Asynchronous optimization of part logistics routing problem

DOI10.1007/S10898-021-01078-ZzbMATH Open1490.90198OpenAlexW3197393447MaRDI QIDQ2124805FDOQ2124805

Authors Yaoting Huang, Boyu Chen, Wenlian Lu, Zhong-Xiao Jin, Ren Zheng

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

zbMATH Keywords

logisticsmixed-integer nonlinear programmingasynchronous optimizationtwo-dimensional capacitated vehicle routing

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• Vehicle routing problem with limited refueling halts using particle swarm optimization with greedy mutation operator
• Solving the vehicle routing problem with multi-compartment vehicles for city logistics
• scientific article; zbMATH DE number 5669925
• Bilayer local search enhanced particle swarm optimization for the capacitated vehicle routing problem
• Research on a kind of optimization model of vehicle logistics problem

Cites work

• scientific article; zbMATH DE number 3165828 (Why is no real title available?)
• scientific article; zbMATH DE number 3970026 (Why is no real title available?)
• A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
• 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
• A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet
• A review of the application of meta-heuristic algorithms to 2D strip packing problems
• A review of vehicle routing with simultaneous pickup and delivery
• A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints
• 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
• Approximation and online algorithms for multidimensional bin packing: a survey
• Introduction to algorithms.
• Optimization by simulated annealing
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• The Decomposition Algorithm for Linear Programs
• The EMS vehicle patient transportation problem during a demand surge
• The periodic vehicle routing problem with intermediate facilities
• Two-dimensional packing problems: a survey
• Variable neighborhood search algorithms for the vehicle routing problem with two‐dimensional loading constraints and mixed linehauls and backhauls
• Variable neighborhood search based approaches to a vehicle scheduling problem in agriculture
• Vehicle Routing
• Vehicle routing with backhauls: review and research perspectives

Cited in

(3)

• Packed parts delivery problem of automotive inbound logistics with a supplier park
• Solving large-scale routing optimization problems with networks and only networks
• Preface to the special issue dedicated to the 6th world congress on global optimization held in Metz, France, July 8--10, 2019

Describes a project that uses

Uses Software

• APL
• VRP

This page was built for publication: Asynchronous optimization of part logistics routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2124805)