Network Design with Routing Requirements

Balakrishnan, Anantaram; Magnanti, Thomas L.; Mirchandani, Pitu B.; Wong, Richard T.

doi:10.1007/978-3-030-64018-7_8

Cited by 2 publications

(1 citation statement)

References 72 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…SND belongs to a general network design problem in transportation planning, logistics, telecommunication, and production systems [12][13][14][15]. The objective of the general network design problem consists of finding a minimum cost network decision, i.e., a network configuration to enable the flow of commodities while minimizing the total cost [16].…”

Section: Literature Reviewmentioning

confidence: 99%

An Iterative Backbone Algorithm for Service Network Design Problems

2022

View full text Add to dashboard Cite

Service network design problems arise at airlines, trucking companies, and railroads wherever there is a need to determine cost-minimizing routes and schedules, given resource availability and service constraints. In recent years, the application of consolidation-based service network design in the express service has attracted lots of academic attention due to the rapid growth of the express industry. This paper studies the consolidation-based service network design problem, which jointly determines the commodity flow, vehicle dispatching, and fleet sizing. We propose a mixed-integer optimization model to address the problem and design an efficient iterative backbone algorithm to solve large-scale real-world problems. The numerical results of large-scale instances confirmed that the solution obtained by our proposed algorithm is better than that of the primal model, and the running time taken is less than half that of the general solution approach. The computational study confirmed the effectiveness and efficiency of the proposed algorithm.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

An Iterative Backbone Algorithm for Service Network Design Problems

2022

View full text Add to dashboard Cite

show abstract

Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models

Balakrishnan

Mirchandani

Lin

2022

Operations Research

View full text Add to dashboard Cite

Modeling Crew Assignments for Urban Transport Services Using Differentiated Flows Public transit agencies need to judiciously deploy their limited crew members to operate numerous daily scheduled services, while meeting duty and working time regulations for each crew member. Since crew costs account for a large portion of the organizations’ operating expenses, minimizing the total crew and transfer costs is very important. But, with hundreds of daily trips and millions of possible crew itineraries, optimizing trip-to-crew assignment decisions is challenging. In “Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models,” Balakrishnan, Mirchandani, and Lin propose a novel integer optimization model that represents itineraries as multicommodity flows, differentiated by first trip and depot, to capture the duty time limits and incorporate additional requirements such as selecting equitable schedules. The authors show that this compact model can be tighter than previous formulations, further strengthen the model, and propose a restricted optimization approach combined with an optimality test to generate near-optimal solutions quickly. Extensive computational tests using well-known and real-life problem instances show that the proposed model and solution approach can be very effective in practice.

show abstract

Network Design with Routing Requirements

Cited by 2 publications

References 72 publications

An Iterative Backbone Algorithm for Service Network Design Problems

An Iterative Backbone Algorithm for Service Network Design Problems

Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models

Contact Info

Product

Resources

About