Optimal sequencing of skip collections and deliveries

被引：36

作者：

DeMeulemeester, L

Laporte, G

Louveaux, FV

Semet, F

机构：

[1] ECOLE HAUTES ETUD COMMERCIALES,MONTREAL,PQ H3T 1V6,CANADA

[2] FAC UNIV NOTRE DAME PAIX,B-5000 NAMUR,BELGIUM

[3] UNIV MONTREAL,MONTREAL,PQ H3C 3J7,CANADA

来源：

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | 1997年 / 48卷 / 01期

基金：

加拿大自然科学与工程研究理事会;

关键词：

vehicle routing; skips; savings; transportation problem; branch-and-bound;

D O I：

10.1057/palgrave.jors.2600325

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

The purpose of this paper is to model and solve a complex routing problem associated with the collection and delivery of skips. This study is motivated by a real-life problem encountered by a skip rental firm in Belgium. Two simple heuristics as well as an exact enumerative algorithm are developed for the problem. Computational experiments carried out on both randomly generated and real-life data confirm the efficiency of the proposed approach.

引用

页码：57 / 64

页数：8

共 6 条

[1]

Ahuja R.K., 1993, NETWORK FLOWS THEORY

[2] SOME NEW BRANCHING AND BOUNDING CRITERIA FOR THE ASYMMETRIC TRAVELING SALESMAN PROBLEM [J].