.png){kind=icon}
.png){kind=icon}
Return
A LP-based heuristic for a time-constrained routing problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2004.09.055.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper we present a LP-based heuristic for the solution of a Time Constrained Routing problem arising from innovative services accessible via World Wide Web. The problem consists of scheduling the visit of a tourist to a given geographical area in order to maximize his satisfaction degree whilst respecting time windows restrictions. We refer to this problem as the Intelligent Tourist Problem (ITP). ITP is formulated as a Set Packing problem with side constraints. Due to the huge number of variables in the formulation, the LP-relaxation is solved by a column-and-row generation approach. Then we run a MIP solver over the active columns to get a feasible solution. Computational experience on real-world instances is reported showing the effectiveness of the proposed approach. (c) 2005 Published by Elsevier B.V.
Keywords:
time constrained routing
set packing
column-and-row generation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available