Coordinating assignment and routing decisions in transit vehicle schedules: A variable-splitting Lagrangian decomposition approach for solution symmetry breaking

Huimin Niu, Xuesong Zhou, Xiaopeng Tian

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

This paper focuses on how to coordinate a critical set of assignment and routing decisions in a class of multiple-depot transit vehicle scheduling problems. The assignment decision aims to assign a set of transit vehicles from their current locations to trip tasks in a given timetable, where the routing decision needs to route different vehicles to perform the assigned tasks and return to the depot or designated layover locations. When applying the general purpose solvers and task-oriented Lagrangian relaxation framework for real world instances, a thorny issue is that different but indistinguishable vehicles from the same depot or similar locations could commit to the same set of tasks. This inherent solution symmetry property causes extremely difficult computational barriers for effectively eliminating identical solutions, and the lower bound solutions could contain many infeasible vehicle-to-task matches, leading to large optimality gaps. To systematically coordinate the assignment and routing decisions and further dynamically break symmetry during the solution search process, we adopt a variable-splitting approach to introduce task-specific and vehicle-distinguishable Lagrangian multipliers and then propose a sequential assignment process in order to enhance the solution quality for the augmented models with tight formulations. We conduct the numerical experiments to offer the managerial interpretation and examine solution quality of the proposed approach in a wider range of applications.

Original languageEnglish (US)
Pages (from-to)70-101
Number of pages32
JournalTransportation Research Part B: Methodological
Volume107
DOIs
StatePublished - Jan 1 2018

Fingerprint

Decomposition
multiplier
scheduling
interpretation
cause
experiment
Scheduling
Experiments

Keywords

  • Coordination
  • Lagrangian relaxation
  • Network reduction
  • Symmetry breaking
  • Transit vehicle scheduling

ASJC Scopus subject areas

  • Transportation

Cite this

@article{c2d4abb558694a2e83169cb4fa91a823,
title = "Coordinating assignment and routing decisions in transit vehicle schedules: A variable-splitting Lagrangian decomposition approach for solution symmetry breaking",
abstract = "This paper focuses on how to coordinate a critical set of assignment and routing decisions in a class of multiple-depot transit vehicle scheduling problems. The assignment decision aims to assign a set of transit vehicles from their current locations to trip tasks in a given timetable, where the routing decision needs to route different vehicles to perform the assigned tasks and return to the depot or designated layover locations. When applying the general purpose solvers and task-oriented Lagrangian relaxation framework for real world instances, a thorny issue is that different but indistinguishable vehicles from the same depot or similar locations could commit to the same set of tasks. This inherent solution symmetry property causes extremely difficult computational barriers for effectively eliminating identical solutions, and the lower bound solutions could contain many infeasible vehicle-to-task matches, leading to large optimality gaps. To systematically coordinate the assignment and routing decisions and further dynamically break symmetry during the solution search process, we adopt a variable-splitting approach to introduce task-specific and vehicle-distinguishable Lagrangian multipliers and then propose a sequential assignment process in order to enhance the solution quality for the augmented models with tight formulations. We conduct the numerical experiments to offer the managerial interpretation and examine solution quality of the proposed approach in a wider range of applications.",
keywords = "Coordination, Lagrangian relaxation, Network reduction, Symmetry breaking, Transit vehicle scheduling",
author = "Huimin Niu and Xuesong Zhou and Xiaopeng Tian",
year = "2018",
month = "1",
day = "1",
doi = "10.1016/j.trb.2017.11.003",
language = "English (US)",
volume = "107",
pages = "70--101",
journal = "Transportation Research, Series B: Methodological",
issn = "0191-2615",
publisher = "Elsevier Limited",

}

TY - JOUR

T1 - Coordinating assignment and routing decisions in transit vehicle schedules

T2 - A variable-splitting Lagrangian decomposition approach for solution symmetry breaking

AU - Niu, Huimin

AU - Zhou, Xuesong

AU - Tian, Xiaopeng

PY - 2018/1/1

Y1 - 2018/1/1

N2 - This paper focuses on how to coordinate a critical set of assignment and routing decisions in a class of multiple-depot transit vehicle scheduling problems. The assignment decision aims to assign a set of transit vehicles from their current locations to trip tasks in a given timetable, where the routing decision needs to route different vehicles to perform the assigned tasks and return to the depot or designated layover locations. When applying the general purpose solvers and task-oriented Lagrangian relaxation framework for real world instances, a thorny issue is that different but indistinguishable vehicles from the same depot or similar locations could commit to the same set of tasks. This inherent solution symmetry property causes extremely difficult computational barriers for effectively eliminating identical solutions, and the lower bound solutions could contain many infeasible vehicle-to-task matches, leading to large optimality gaps. To systematically coordinate the assignment and routing decisions and further dynamically break symmetry during the solution search process, we adopt a variable-splitting approach to introduce task-specific and vehicle-distinguishable Lagrangian multipliers and then propose a sequential assignment process in order to enhance the solution quality for the augmented models with tight formulations. We conduct the numerical experiments to offer the managerial interpretation and examine solution quality of the proposed approach in a wider range of applications.

AB - This paper focuses on how to coordinate a critical set of assignment and routing decisions in a class of multiple-depot transit vehicle scheduling problems. The assignment decision aims to assign a set of transit vehicles from their current locations to trip tasks in a given timetable, where the routing decision needs to route different vehicles to perform the assigned tasks and return to the depot or designated layover locations. When applying the general purpose solvers and task-oriented Lagrangian relaxation framework for real world instances, a thorny issue is that different but indistinguishable vehicles from the same depot or similar locations could commit to the same set of tasks. This inherent solution symmetry property causes extremely difficult computational barriers for effectively eliminating identical solutions, and the lower bound solutions could contain many infeasible vehicle-to-task matches, leading to large optimality gaps. To systematically coordinate the assignment and routing decisions and further dynamically break symmetry during the solution search process, we adopt a variable-splitting approach to introduce task-specific and vehicle-distinguishable Lagrangian multipliers and then propose a sequential assignment process in order to enhance the solution quality for the augmented models with tight formulations. We conduct the numerical experiments to offer the managerial interpretation and examine solution quality of the proposed approach in a wider range of applications.

KW - Coordination

KW - Lagrangian relaxation

KW - Network reduction

KW - Symmetry breaking

KW - Transit vehicle scheduling

UR - http://www.scopus.com/inward/record.url?scp=85035310247&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85035310247&partnerID=8YFLogxK

U2 - 10.1016/j.trb.2017.11.003

DO - 10.1016/j.trb.2017.11.003

M3 - Article

AN - SCOPUS:85035310247

VL - 107

SP - 70

EP - 101

JO - Transportation Research, Series B: Methodological

JF - Transportation Research, Series B: Methodological

SN - 0191-2615

ER -