An efficient guided local search approach for service network design problem with asset balancing

Author

Bai, Ruibin ; Kendall, Graham ; Li, Jiawei

Author_Institution

Div. of Comput. Sci., Univ. of Nottingham Ningbo, Ningbo, China

Volume

1

fYear

2010

fDate

9-10 Jan. 2010

Firstpage

110

Lastpage

115

Abstract

Service network design is a core problem for logistic transportation planning. It involves determination of the most cost-effective transportation network, package flow distribution as well as balanced vehicle schedules. In this paper, we propose an efficient guided local search approach metaheuristic for this problem, which is able to produce competitive results with much less computational time than those proposed in the literature.

Keywords

logistics; planning; transportation; asset balancing; balanced vehicle schedules; cost-effective transportation network; efficient guided local search approach metaheuristic; logistic transportation planning; package flow distribution; service network design problem; Computer science; Costs; Electronic mail; Linear programming; Logistics; Packaging; Processor scheduling; Telecommunication computing; Transportation; Vehicles; Freight Transportation; Guided Local Search; Linear Programming; Logistics;

fLanguage

English

Publisher

ieee

Conference_Titel

Logistics Systems and Intelligent Management, 2010 International Conference on

Conference_Location

Harbin

Print_ISBN

978-1-4244-7331-1

Type

conf

DOI

10.1109/ICLSIM.2010.5461456

Filename

5461456