A comparison of different lower bounding procedures for the routing of automated guided vehicles in an urban context. (2015)

• Record Type: Journal Article
• Authors: Fatnassi, Ezzeddine; Chaouachi, Jouhaina
• Is Part Of: International journal of applied nonlinear science. Volume 2:Number 1/2(2015)
• Page Start: 120
• Page End: 135
• Publication Date: 2015
• Subjects: automated guided vehicles -- AGVs -- lower bounds -- vehicle routing problem -- VRP -- urban environment -- cities -- battery constraints -- time window constraints -- electric vehicles -- self-driving vehicles -- autonomous vehicles; Science -- Mathematical models -- Periodicals; Engineering -- Mathematical models -- Periodicals; Nonlinear theories -- Periodicals; 501.5118
• Languages: English
• ISSNs: 1752-2862

Abstract

We propose different lower bounding procedures to solve the problem of routing a set of automated guided vehicles in an urban context. This problem consists of designing a set of low-cost roads starting and ending at a depot while satisfying a set of transportation demands in an urban area. The problem is treated under a set of different constraints, such as battery constraints and time window constraints. Our lower bounding approach consists of a decomposition method in which we first solve a relaxed problem. We then deal with the set of infeasible routes obtained from the relaxed problem. The different procedures developed in this paper allow us to find a set of good-quality lower bounds.