IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v32y2015i03ns0217595915500189.html
   My bibliography  Save this article

A Two-Echelon Neighborhood Search Algorithm for a Forwarder's Job Assignment in a Multi-Agent Logistics Network

Author

Listed:
  • Yong Wang

    (College of Economics and Business Administration, Chongqing University, Chongqing 400030, P. R. China)

  • Wen He

    (School of Business Administration, Hunan University, Changsha 410082, P. R. China)

  • Yer Van Hui

    (Department of Management Sciences, City University of Hong Kong, Hong Kong)

  • Lawrence C. Leung

    (Department of Decision Sciences and Managerial Economics, Chinese University of Hong Kong, Hong Kong)

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.

Suggested Citation

  • Yong Wang & Wen He & Yer Van Hui & Lawrence C. Leung, 2015. "A Two-Echelon Neighborhood Search Algorithm for a Forwarder's Job Assignment in a Multi-Agent Logistics Network," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 32(03), pages 1-18.
    • Handle: RePEc:wsi:apjorx:v:32:y:2015:i:03:n:s0217595915500189
    DOI: 10.1142/S0217595915500189
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595915500189
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595915500189?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wsi:apjorx:v:32:y:2015:i:03:n:s0217595915500189. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.