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

DOI10.1142/S0217595915500189zbMath1321.90027OpenAlexW2168017730MaRDI QIDQ5265459

Yer Van Hui, Lawrence C. Leung, Wang Yong, Wen He

Publication date: 28 July 2015

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595915500189

zbMATH Keywords

job assignmentmulti-agentsneighborhood search algorithmjob consolidationtransport logistics network

Mathematics Subject Classification ID

Nonlinear programming (90C30) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

Towards self‐organizing logistics in transportation: a literature review and typology

Cites Work

• TSP ejection chains
• A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution.
• A model and methodologies for the location problem with logistical components
• Airfreight forwarder shipment planning: A mixed 0-1 model and managerial issues in the integration and consolidation of shipments
• A Subpath Ejection Method for the Vehicle Routing Problem
• An Ejection Chain Approach for the Generalized Assignment Problem
• A composite algorithm for a concave-cost network flow problem
• An Algorithm for the Multiattribute, Multicommodity Flow Problem with Freight Consolidation and Inventory Costs
• An Object-Oriented Methodology for Solving Assignment-Type Problems with Neighborhood Search Techniques
• Finding the K Shortest Loopless Paths in a Network

This page was built for publication: A Two-Echelon Neighborhood Search Algorithm for a Forwarder's Job Assignment in a Multi-Agent Logistics Network