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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Computers & operations research Ročník 96; s. 30 - 54
Hlavní autori:	Riedler, Martin, Raidl, Günther
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Elsevier Ltd 01.08.2018 Pergamon Press Inc
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!