Solving capacitated vehicle routing problem with three-dimensional loading and relocation constraints

This publication has 39 references indexed in Scilit:

• Improved benders-and-price algorithm for the multi-product assembly routing problem with time windows: A domain decomposition strategy for the benders-master model
  Computers & Industrial Engineering, 2023
• A clustering-based extended genetic algorithm for the multidepot vehicle routing problem with time windows and three-dimensional loading constraints
  Applied Soft Computing, 2022
• Local search techniques for a routing-packing problem
  Computers & Industrial Engineering, 2013
• Three-dimensional container loading models with cargo stability and load bearing constraints
  Computers & Operations Research, 2012
• An integrated approach to the vehicle routing and container loading problems
  OR Spectrum, 2008
• Hybrid backward and forward dynamic programming based Lagrangian relaxation for single machine scheduling
  Computers & Operations Research, 2007
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
  Networks, 2004
• Issues in the development of approaches to container loading
  Omega, 1995
• Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints
  Operations Research Letters, 1991
• Complexity of vehicle routing and scheduling problems
  Networks, 1981