{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,24]],"date-time":"2024-01-24T12:20:51Z","timestamp":1706098851498},"reference-count":21,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Asia Pac. J. Oper. Res."],"published-print":{"date-parts":[[2015,6]]},"abstract":" Freight forwarders plan shipping logistics for client shipments based on available transport networks where logistics agents move commodities from origins to destinations. Forwarders typically have the option of assigning shipments to in-house agents or to sub-contracting agents. When making such assignment decisions, consolidation of shipments is a plausible cost-saving consideration. In this paper, we consider assignments of shipments to agents as well as shipment routing choices on a network. We formulate the problem as a nonlinear program where unit costs charged by agents are described as nonlinear functions. The special case with piecewise constant unit costs is formulated as a mixed integer program. We then develop a two-echelon heuristic algorithm to solve the nonlinear program. The upper echelon of the heuristic assigns shipments to suitable agents by adopting a set of neighborhood policies, while the lower echelon improves the routing plan by consolidating jobs along (sub) paths. The feasibility and validity of the heuristic are examined based on randomly generated instances. Computational results show that the heuristic is able to obtain good solutions in manageable computation time. The effects of network density and iteration limits on the performance of the heuristic are also characterized. <\/jats:p>","DOI":"10.1142\/s0217595915500189","type":"journal-article","created":{"date-parts":[[2015,1,19]],"date-time":"2015-01-19T04:44:00Z","timestamp":1421642640000},"page":"1550018","source":"Crossref","is-referenced-by-count":1,"title":["A Two-Echelon Neighborhood Search Algorithm for a Forwarder's Job Assignment in a Multi-Agent Logistics Network"],"prefix":"10.1142","volume":"32","author":[{"given":"Yong","family":"Wang","sequence":"first","affiliation":[{"name":"College of Economics and Business Administration, Chongqing University, Chongqing 400030, P. R. China"}]},{"given":"Wen","family":"He","sequence":"additional","affiliation":[{"name":"School of Business Administration, Hunan University, Changsha 410082, P. R. China"}]},{"given":"Yer Van","family":"Hui","sequence":"additional","affiliation":[{"name":"Department of Management Sciences, City University of Hong Kong, Hong Kong"}]},{"given":"Lawrence C.","family":"Leung","sequence":"additional","affiliation":[{"name":"Department of Decision Sciences and Managerial Economics, Chinese University of Hong Kong, Hong Kong"}]}],"member":"219","published-online":{"date-parts":[[2015,6,10]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1080\/1055678031000107105"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230190202"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/S1366-5545(02)00014-5"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1108\/09600039510093249"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1287\/opre.44.2.347"},{"key":"rf6","first-page":"57","volume":"8","author":"Hall R. W.","year":"1987","journal-title":"Journal of Business Logistics"},{"key":"rf7","first-page":"110","volume":"6","author":"Jackson G. C.","year":"1985","journal-title":"Journal of Business Logistics"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1287\/inte.25.5.42"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1080.0583"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2011.08.001"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(96)00123-0"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(97)00096-8"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1287\/opre.42.2.274"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1108\/09600039810221667"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.44.10.1447"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(01)00023-5"},{"key":"rf17","first-page":"58","volume":"12","author":"Sowinski L.","year":"1999","journal-title":"World Trade"},{"key":"rf18","volume-title":"Graph Theory","author":"Wang S.","year":"2004"},{"key":"rf19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.10.032"},{"key":"rf20","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1030.0036"},{"key":"rf21","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.17.11.712"}],"container-title":["Asia-Pacific Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0217595915500189","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T10:19:36Z","timestamp":1565173176000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0217595915500189"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6]]},"references-count":21,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2015,6,10]]},"published-print":{"date-parts":[[2015,6]]}},"alternative-id":["10.1142\/S0217595915500189"],"URL":"http:\/\/dx.doi.org\/10.1142\/s0217595915500189","relation":{},"ISSN":["0217-5959","1793-7019"],"issn-type":[{"value":"0217-5959","type":"print"},{"value":"1793-7019","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6]]}}}
