Solving a selective dial-a-ride problem with logic-based Benders decomposition

•We propose logic-based Benders algorithms for a selective dial-a-ride problem.•Subproblems are solved using a combination of CP and MILP algorithms.•Four different strategies for refining Benders cuts are tested.•We speed up the master-problem using heuristic boosting techniques. Today’s society is...

Full description

Saved in:

Bibliographic Details
Published in:	Computers & operations research Vol. 96; pp. 30 - 54
Main Authors:	Riedler, Martin, Raidl, Günther
Format:	Journal Article
Language:	English
Published:	New York Elsevier Ltd 01.08.2018 Pergamon Press Inc
Subjects:	Algorithms Benders decomposition Branch-and-check Combinatorial Benders cuts Decomposition Dial-a-Ride problem Integer programming Linear programming Logic-based Benders decomposition Mixed integer Operations research Public transportation Studies Transportation Travel time Windows (intervals) Branch-and-check Dial-a-Ride problem Combinatorial Benders cuts Logic-based Benders decomposition Transportation
ISSN:	0305-0548, 1873-765X, 0305-0548
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!