Service network design with management and coordination of multiple fleets

Andersen, Jardar; Crainic, Teodor Gabriel; Christiansen, Marielle

doi:10.1016/j.ejor.2007.10.057

Cited by 132 publications

(63 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The tabu search method outperformed a commercial MIP solver when computational time was limited to one hour per instance on a test PC with a Pentium IV 2.26GHz CPU. Andersen et al [3] compared the nodearc based formulation, the path-based formulation and a cycle-based formulation for SNDP problems. Computational results on a set of small randomly generated instances indicated that the cycle-based formulation gave significantly stronger bounds than the other two and hence may allow for much faster solution of problems.…”

Section: Problem Description and Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

Tabu assisted guided local search approaches for freight service network design

Bai

Kendall

et al. 2012

Information Sciences

View full text Add to dashboard Cite

The service network design problem (SNDP) is a core problem in freight transportation. It involves the determination of the most cost-effective transportation network and the characteristics of the corresponding services, subject to various constraints. The scale of the problem in real-world applications is usually very large, especially when the network contains both the geographical information and the temporal constraints which are necessary for modelling multiple service-classes and dynamic events. The development of time-efficient algorithms for this problem is, therefore, crucial for successful real-world applications. Earlier research indicated that guided local search (GLS) was a promising solution method for this problem. One of the advantages of GLS is that it makes use of both the information collected during the search as well as any special structures which are present in solutions. Building upon earlier research, this paper carries out in-depth investigations into several mechanisms that could potentially speed up the GLS algorithm for the SNDP. Specifically, the mechanisms that we have looked at in this paper include a tabu list (as used by tabu search), short-term memory, and an aspiration criterion. An efficient hybrid algorithm for the SNDP is then proposed, based upon the results of these experiments. The algorithm combines a tabu list within a multi-start GLS approach, with an efficient feasibility-repairing heuristic. Experimental tests on a set of 24 well-known service network design benchmark instances have shown that the proposed algorithm is superior to a previously proposed tabu search method, reducing the computation time by over a third. In addition, we also show that far better results can be obtained when a faster linear program solver * Corresponding author is adopted for the sub-problem solution. The contribution of this paper is an efficient algorithm, along with detailed analyses of effective mechanisms which can help to increase the speed of the GLS algorithm for the SNDP.

show abstract

Section: Problem Description and Literature Reviewmentioning

confidence: 99%

“…Integrating services of multiple classes would probably require the introduction of a time-space network, which would dramatically increase the problem sizes [3], and hence the solution times. Problems of such large sizes are very difficult for current approaches.…”

Section: Introductionmentioning

confidence: 99%

Tabu assisted guided local search approaches for freight service network design

Bai

Kendall

et al. 2012

Information Sciences

View full text Add to dashboard Cite

show abstract

“…Experimental results show significant improvements in terms of shipments attracted to the proposed services. Andersen et al (2009b) emphasize the need for synchronization in intermodal rail transport. The authors address multi-fleet management and coordination in intermodal rail transport as well as interactions between rail services and services in collaborating transportation systems.…”

Section: Network Operatormentioning

confidence: 99%

“…A hub location and network design model for a general intermodal transportation network is presented by Yoon and Current (2008). Andersen et al (2009b) formulate a service network design model to study the impact of an increased level of synchronization in intermodal rail transport on the rail efficiency and interoperability across borders.…”

Section: Applications In Intermodal Transportmentioning

confidence: 99%

Simulation and optimisation of intermodal barge transport networks

Caris

2010

4OR-Q J Oper Res

View full text Add to dashboard Cite

“…Agarwal and Ergun (2010) address problems of collaborative planning between a coalition of liner shippers by integrating mechanisms from cooperative game theory. Andersen et al (2009) focus on synchronizing multiple service networks operated by different companies.…”

Section: Introductionmentioning

confidence: 99%

Cooperative liner shipping network design by means of a combinatorial auction

Buer

Haass

2017

Flex Serv Manuf J

View full text Add to dashboard Cite

Standard-Nutzungsbedingungen:Die Dokumente auf EconStor dürfen zu eigenen wissenschaftlichen Zwecken und zum Privatgebrauch gespeichert und kopiert werden.Sie dürfen die Dokumente nicht für öffentliche oder kommerzielle Zwecke vervielfältigen, öffentlich ausstellen, öffentlich zugänglich machen, vertreiben oder anderweitig nutzen.Sofern die Verfasser die Dokumente unter Open-Content-Lizenzen (insbesondere CC-Lizenzen) zur Verfügung gestellt haben sollten, gelten abweichend von diesen Nutzungsbedingungen die in der dort genannten Lizenz gewährten Nutzungsrechte. Terms of use: Documents in ABSTRACTA liner shipping network design problem is considered which includes ship scheduling and cargo routing decisions. The question is how to enable loose cooperation of multiple liner shippers for jointly solving this profit maximizing network design problem. A variable neighborhood search matheuristic is developed to compute a network for each liner shipper. To coordinate the planning process of multiple liner shippers, a combinatorial auction is proposed.To evaluated the mechanism a computational study is performed which shows that cooperation is in many cases possible and beneficial. As the proposed joint planning mechanism requires less exchange of sensitive information compared to a centralized approach, it enables looser forms of cooperation during network design.

show abstract

Service network design with management and coordination of multiple fleets

Cited by 132 publications

References 8 publications

Tabu assisted guided local search approaches for freight service network design

Tabu assisted guided local search approaches for freight service network design

Simulation and optimisation of intermodal barge transport networks

Cooperative liner shipping network design by means of a combinatorial auction

Contact Info

Product

Resources

About