A practical time slot management and routing problem for attended home services

被引：28

作者：

Bruck, Bruno P. ^{[1
]}

Cordeau, Jean-Francois ^{[2
,3
]}

Iori, Manuel ^{[1
]}

机构：

[1] Univ Modena & Reggio Emilia, Dept Sci & Methods Engn, Via Amendola 2, I-42122 Reggio Emilia, Italy

[2] HEC Montreal, 3000 Chemin Cote St Catherine, Montreal, PQ H3T 2A7, Canada

[3] CIRRELT, 3000 Chemin Cote St Catherine, Montreal, PQ H3T 2A7, Canada

来源：

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE | 2018年 / 81卷

关键词：

Attended home delivery; Time slot management; Routing; Large neighborhood search; Integer linear programming; SEARCH; FORMULATIONS; WINDOWS;

D O I：

10.1016/j.omega.2017.11.003

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper describes the solution methodology developed to address an attended home delivery problem faced by an Italian provider of gas, electricity, and water services. This company operates in several regions and must dispatch technicians to customer locations where they carry out installation or maintenance activities within time intervals chosen by the customers. The problem consists of creating time slot tables specifying the amount of resources allocated to each region in each time slot, and of routing technicians in a cost-effective way. We propose a large neighborhood search (LNS) heuristic to create time slot tables by relying on various simulation strategies to represent the behavior of customers and on an integer linear program to optimize the routing of technicians. In addition, we also use a second integer program as a repair mechanism inside the LNS heuristic. Computational experiments carried out on data provided by the company confirm the efficiency of the proposed methodology. (C) 2017 Elsevier Ltd. All rights reserved.

引用

页码：208 / 219

页数：12

共 20 条

[1] Time Slot Management in Attended Home Delivery [J].

Agatz, Niels ;

Campbell, Ann ;

Fleischmann, Moritz ;

Savelsbergh, Martin .

TRANSPORTATION SCIENCE, 2011, 45 (03) :435-449

[2]

Agatz N, 2008, OPER RES COMPUT SCI, V43, P379, DOI 10.1007/978-0-387-77778-8_17

[3] Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints [J].

Baldacci, Roberto ;

Mingozzi, Aristide ;

Roberti, Roberto .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 218 (01) :1-6

[4] The multiple traveling salesman problem: an overview of formulations and solution procedures [J].

Bektas, T .

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2006, 34 (03) :209-219

[5] Vehicle routing problem with time windows, part 1:: Route construction and local search algorithms [J].

Bräysy, I ;

Gendreau, M .

TRANSPORTATION SCIENCE, 2005, 39 (01) :104-118

[6] Vehicle routing problem with time windows, part II:: Metaheuristics [J].

Bräysy, I ;

Gendreau, M .

TRANSPORTATION SCIENCE, 2005, 39 (01) :119-139

[7] Decision support for consumer direct grocery initiatives [J].

Campbell, AM ;

Savelsbergh, MWP .

TRANSPORTATION SCIENCE, 2005, 39 (03) :313-327

[8] Incentive schemes for attended home delivery services [J].

Campbell, Ann Melissa ;

Savelsbergh, Martin .

TRANSPORTATION SCIENCE, 2006, 40 (03) :327-341

[9] The technician routing problem with experience-based service times [J].

Chen, Xi ;

Thomas, Barrett W. ;

Hewitt, Mike .

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2016, 61 :49-61

[10] When Are Deliveries Profitable? Considering Order Value and Transport Capacity in Demand Fulfillment for Last-Mile Deliveries in Metropolitan Areas [J].

Cleophas, Catherine ;

Ehmke, Jan Fabian .

BUSINESS & INFORMATION SYSTEMS ENGINEERING, 2014, 6 (03) :153-163

← 1 2 →