10:30 AM - 10:55 AM
The Multi-Compartment Delivery Problem
The distribution of products using vehicles with compartments involves many decisions such as vehicle routing, inventory control of several types of products, and their allocation to vehicle compartments. In this presentation we will review the main categories of Multi-Compartment Delivery problems and present two linear models and their resolution.
10:55 AM - 11:20 AM
Multicriteria Optimization of a Long-Haul Routing and Scheduling Problem
We introduce a multi-objective vehicle routing and truck driver scheduling problem under the legislative requirements on work and rest hours in the United States (USMOVRTDSP). We present a tabu search algorithm that solves this problem and provides solution sets from which tradeoffs between operating costs and driver inconvenience are evaluated.
11:20 AM - 11:45 AM
Adaptative Large Neighborhood Search for the Periodic Capacitated Arc Routing Problem with Inventory Constraints
The edges of a network behave as customers. Routing and inventory decisions are made simultaneously. An example is dust suppression in open-pit mines. We develop a mathematical model that minimizes the penalty for the lack of humidity and watering and traversing costs of each edge. Due to the complexity of the mathematical model, we also develop an adaptive large neighborhood search program to solve the problem.
11:45 AM - 12:10 PM
Network Design in Order to Minimize Soil Damage While Maintaing Efficient Logistic Operations
We develop a decision support tool to construct road network at harvest areas for harvesters and forwarders. We use high quality GIS information to minimize ground damage and at the same time maintain efficient logistic operations. The solution method is based on a Lagrangian relaxation of a network design model. Each subproblem is a shortest path tree. In addition of the network design, we also find an efficient routing of forwarders. The system is tested on case studies from Swedish forest companies.