Asynchronous optimization of part logistics routing problem
DOI10.1007/s10898-021-01078-zzbMath1490.90198OpenAlexW3197393447MaRDI QIDQ2124805
Wenlian Lu, Boyu Chen, Ren Zheng, Zhong-Xiao Jin, Yaoting Huang
Publication date: 11 April 2022
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-021-01078-z
logisticsmixed-integer nonlinear programmingasynchronous optimizationtwo-dimensional capacitated vehicle routing
Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- An improved branch and bound algorithm for mixed integer nonlinear programs
- The periodic vehicle routing problem with intermediate facilities
- A review of the application of meta-heuristic algorithms to 2D strip packing problems
- Vehicle routing with backhauls: review and research perspectives
- A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints
- A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet
- Two-dimensional packing problems: a survey
- The EMS vehicle patient transportation problem during a demand surge
- Approximation and online algorithms for multidimensional bin packing: a survey
- A review of vehicle routing with simultaneous pickup and delivery
- Vehicle Routing
- The Decomposition Algorithm for Linear Programs
- A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
- Variable neighborhood search based approaches to a vehicle scheduling problem in agriculture
- Variable neighborhood search algorithms for the vehicle routing problem with two‐dimensional loading constraints and mixed linehauls and backhauls
This page was built for publication: Asynchronous optimization of part logistics routing problem