This study will discuss the capacitated vehicle routing problem with simultaneous pick-up and delivery in a cross-docking environment. The transportation system includes three levels in the supply chain management:(1)Suppliers, (2)Retailers, (3)Customers. This paper addresses the CVRPCD, where a set of homogeneous vehicles are used to transport products from the suppliers to the corresponding customers via a cross-dock. The objective of the CVRPCD is to minimize the total traveled distance while respecting time window constraints at the nodes and a time horizon for the whole transportation operation. In this paper, a mixed integer programming formulation for the CVRPCD is proposed.
A multi operator genetic algorithm for solving the capacitated vehicle routing problem with cross-docking problem
2016-12-01
308533 byte
Conference paper
Electronic Resource
English
Hybrid Heuristic Algorithm for solving Capacitated Vehicle Routing problem
BASE | 2014
|Improved Genetic Algorithm for Capacitated Vehicle Routing Problem
British Library Conference Proceedings | 2013
|Improved Genetic Algorithm for Capacitated Vehicle Routing Problem
British Library Conference Proceedings | 2013
|An efficient meta-heuristic algorithm for solving capacitated vehicle routing problem
BASE | 2018
|A multi-stage algorithm for a capacitated vehicle routing problem with time constraints
BASE | 2018
|