Combinatorial optimization and Green Logistics

被引：129

作者：

Sbihi, Abdelkader ^{[1
]}

Eglese, Richard W. ^{[2
]}

机构：

[1] Audencia Nantes Sch Management, Dept Informat Syst & Decis Making Sci, F-44312 Nantes 3, France

[2] Univ Lancaster, Sch Management, Dept Management Sci, Lancaster LA1 4YX, England

来源：

ANNALS OF OPERATIONS RESEARCH | 2010年 / 175卷 / 01期

基金：

英国工程与自然科学研究理事会;

关键词：

Green Logistics; Reverse logistics; Combinatorial optimization; Waste management; Hazardous materials; PROGRAMMING-MODEL; REVERSE LOGISTICS; ROUTING-PROBLEMS; SCATTER SEARCH; ARC; ALGORITHMS; FORMULATIONS; HEURISTICS; NETWORK;

D O I：

10.1007/s10479-009-0651-z

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

The purpose of this paper is to introduce the area of Green Logistics and to describe some of the problems that arise in this subject which can be formulated as combinatorial optimization problems. The paper particularly considers the topics of reverse logistics, waste management and vehicle routing and scheduling.

引用

页码：159 / 175

页数：17

共 85 条

[1] A SET-PARTITIONING BASED EXACT ALGORITHM FOR THE VEHICLE-ROUTING PROBLEM
AGARWAL, Y
MATHUR, K
SALKIN, HM
[J]. NETWORKS, 1989, 19 (07) : 731 - 749
[2] A constraint programming approach to the Chinese postman problem with time windows
Aminu, U. F.
Eglese, R. W.
[J]. COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (12) : 3423 - 3431
[3] [Anonymous], 1987, Surveys in Combinatorial Optimization, North-Holland Mathematics Studies
[4] [Anonymous], 2006, OR MS TODAY
[5] Vehicle routing in the 1-skip collection problem
Archetti, C
Speranza, MG
[J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2004, 55 (07) : 717 - 727
[6] Baldacci R, 2006, NETWORKS, V47, P52, DOI [10.1002/net.20091, 10.1002/NET.20091]
[7] A two-level network for recycling sand: A case study
Barros, AI
Dekker, R
Scholten, V
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 110 (02) : 199 - 214
[8] Lower and upper bounds for the mixed capacitated arc routing problem
Belenguer, Jose-Manuel
Benavent, Enrique
Lacomme, Philippe
Prins, Christian
[J]. COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (12) : 3363 - 3383
[9] THE CAPACITATED ARC ROUTING PROBLEM - LOWER BOUNDS
BENAVENT, E
CAMPOS, V
CORBERAN, A
MOTA, E
[J]. NETWORKS, 1992, 22 (07) : 669 - 690
[10] A guided local search heuristic for the capacitated arc routing problem
Beullens, P
Muyldermans, L
Cattrysse, D
Van Oudheusden, D
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 147 (03) : 629 - 643

← 1 2 3 4 5 6 7 8 9 →