A comparison of different lower bounding procedures for the routing of automated guided vehicles in an urban context
by Ezzeddine Fatnassi; Jouhaina Chaouachi
International Journal of Applied Nonlinear Science (IJANS), Vol. 2, No. 1/2, 2015

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.

Online publication date: Wed, 11-May-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Applied Nonlinear Science (IJANS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com