VNS as an upper bound for an exact method to solve a class of on-demand transit transportation systems

This paper considers the offline routing of a Personal Rapid Transit system. In particular, a branch and bound approach is combined with a variable neighborhood search, and this is adapted to the context of the problem as we introduce some linear programming techniques and different neighborhood ope...

Full description

Saved in:

Bibliographic Details
Published in:	Electronic notes in discrete mathematics Vol. 47; pp. 101 - 108
Main Authors:	Fatnassi, Ezzeddine, Chaouachi, Jouhaina
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01-02-2015
Subjects:	Branch and Bound Personal Rapid Transit Routing VNS Routing VNS Branch and Bound Personal Rapid Transit
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	This paper considers the offline routing of a Personal Rapid Transit system. In particular, a branch and bound approach is combined with a variable neighborhood search, and this is adapted to the context of the problem as we introduce some linear programming techniques and different neighborhood operators to enhance its performance. Computational results show a good average gap between the lower and our method and this can be found in a relatively good computational time.
ISSN:	1571-0653 1571-0653
DOI:	10.1016/j.endm.2014.11.014