A multi-stop routing problem

A multi-stop routing problem

0.00 Avg rating0 Votes
Article ID: iaor2009324
Country: Netherlands
Volume: 157
Issue: 1
Start Page Number: 153
End Page Number: 167
Publication Date: Jan 2008
Journal: Annals of Operations Research
Authors: , ,
Keywords: programming: integer
Abstract:

The problem of determining the sequence of stops and the amount of load to carry in each segment route, named the Multi-Stop Routing Problem (MSRP) is addressed. A 0/1 mixed integer linear program and formulation refinements which facilitate the solution process are presented. Since the constraint set of the MSRP includes 0/1 mixed rows, valid inequalities for this type of regions are presented. Then these results are applied to the constraint set of the routing problem, presenting additional valid inequalities.

Reviews

Required fields are marked *. Your email address will not be published.