10h30 - 10h55
A Modular Heuristic Algorithm for Bi-Criteria Multi-Depot and Periodic Vehicle Routing Problems
We propose a heuristic epsilon-constraint method to efficiently tackle three vehicle routing problems, i.e., multi-depot VRP, periodic VRP and multi-depot periodic VRP with capacitated vehicles and constrained route duration. In each of these problems, two contradicting objectives, i.e., total number of used vehicles and total traveled distance, are to be simultaneously minimized.
10h55 - 11h20
An Integrative Cooperative Search for a Bi-Criteria Multi-Depot Periodic Vehicle Routing Problem
We design an integrative cooperative search framework to solve a vehicle routing problem characterized by the presence of a homogeneous fleet of vehicles, multiple depots, multiple periods and two kinds of practical constraints, i.e., vehicle capacity and route duration constraints. The goal is to simultaneously optimize two conflicting objectives, i.e., total number of used vehicles and total traveled distance.
11h20 - 11h45
An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints
We consider a packing problem found in the delivery industry, where it must be determined if a set of rectangular items can be loaded in a truck so that the items of each customer are directly reachable at the time of delivery (i.e., without moving any other item).
11h45 - 12h10
A Column Generation Algorithm for Multi-Depot Vehicle Routing Problem with Inter-Depot Routes
We propose a column generation algorithm to solve the multi-depot vehicle routing problem with inter-depot routes. We model it as a set-covering problem with an additional constraint and design two pricing subproblems to generate the variables. We embed the column generation algorithm in a branch-and-bound algorithm and conduct computational experiments.