A two-echelon neighborhood search algorithm for a forwarder's job assignment in a multi-agent logistics network
From MaRDI portal
Publication:5265459
Recommendations
- Airfreight forwarder shipment planning: A mixed 0-1 model and managerial issues in the integration and consolidation of shipments
- scientific article; zbMATH DE number 1189257
- Direct shipping logistic planning for a hub‐and‐spoke network with given discrete intershipment times
- Freight consolidation with divisible shipments, delivery time windows, and piecewise transportation costs
- Solving a Freight Transport Problem Using Facility Location Techniques
Cites work
- A composite algorithm for a concave-cost network flow problem
- A model and methodologies for the location problem with logistical components
- A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution.
- A subpath ejection method for the vehicle routing problem
- Airfreight forwarder shipment planning: A mixed 0-1 model and managerial issues in the integration and consolidation of shipments
- 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
- An ejection chain approach for the generalized assignment problem
- Finding the K Shortest Loopless Paths in a Network
- TSP ejection chains
This page was built for publication: A two-echelon neighborhood search algorithm for a forwarder's job assignment in a multi-agent logistics network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5265459)