The CAT metaheuristic for the solution of multi-period activity-based supply chain network design problems

被引:19
作者
Carle, Marc-Andre [1 ,2 ]
Martel, Alain [1 ,2 ]
Zufferey, Nicolas [2 ,3 ]
机构
[1] Univ Laval, Dept Operat & Syst Decis, Quebec City, PQ G1V 0A6, Canada
[2] Interuniv Res Ctr Enterprise Networks Logist & Tr, Montreal, PQ, Canada
[3] Univ Geneva, HEC, Fac Econ & Social Sci, CH-1211 Geneva 4, Switzerland
基金
加拿大自然科学与工程研究理事会;
关键词
Supply chain network design; Activity graph; Location; Facility configuration; Vendor selection; Transportation options; Market offers; Methaheuristic; A-Teams; STOCHASTIC-PROGRAMMING APPROACH; VARIABLE NEIGHBORHOOD SEARCH; DISTRIBUTION-SYSTEM-DESIGN; GENETIC ALGORITHM; FACILITY LOCATION; TECHNOLOGY SELECTION; MODEL; OPTIMIZATION; METHODOLOGY;
D O I
10.1016/j.ijpe.2012.06.016
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This paper proposes an agent-based metaheuristic to solve large-scale multi-period supply chain network design problems. The generic design model formulated covers the entire supply chain, from vendor selection, to production-distribution sites configuration, transportation options and marketing policy choices. The model is based on the mapping of a conceptual supply chain activity graph on potential network locations. To solve this complex design problem, we propose Collaborative Agent Team (CAT), an efficient hybrid metaheuristic based on the concept of asynchronous agent teams (A-Teams). Computational results are presented and discussed for large-scale supply chain networks, and the results obtained with CAT are compared to those obtained with the latest version of CPLEX. (c) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码:664 / 677
页数:14
相关论文
共 59 条
[1]   Improving the feasibility pump [J].
Achterberg, Tobias ;
Berthold, Timo .
DISCRETE OPTIMIZATION, 2007, 4 (01) :77-86
[2]   A genetic algorithm approach for multi-objective optimization of supply chain networks [J].
Altiparmak, Fulya ;
Gen, Mitsuo ;
Lin, Lin ;
Paksoy, Turan .
COMPUTERS & INDUSTRIAL ENGINEERING, 2006, 51 (01) :196-215
[3]   A steady-state genetic algorithm for multi-product supply chain network design [J].
Altiparmak, Fulya ;
Gen, Mitsuo ;
Lin, Lin ;
Karaoglan, Ismail .
COMPUTERS & INDUSTRIAL ENGINEERING, 2009, 56 (02) :521-537
[4]   Designing a distribution network in a supply chain system: Formulation and efficient solution procedure [J].
Amiri, A .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 171 (02) :567-576
[5]   A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations [J].
Amrani, Houssam ;
Martel, Alain ;
Zufferey, Nicolas ;
Makeeva, Polina .
OR SPECTRUM, 2011, 33 (04) :989-1007
[6]   GLOBAL SUPPLY CHAIN MANAGEMENT AT DIGITAL-EQUIPMENT-CORPORATION [J].
ARNTZEN, BC ;
BROWN, GG ;
HARRISON, TP ;
TRAFTON, LL .
INTERFACES, 1995, 25 (01) :69-93
[7]   Designing an integrated multi-echelon agile supply chain network: a hybrid taguchi-particle swarm optimization approach [J].
Bachlaus, Manish ;
Pandey, Mayank Kumar ;
Mahajan, Chetan ;
Shankar, Ravi ;
Tiwari, M. K. .
JOURNAL OF INTELLIGENT MANUFACTURING, 2008, 19 (06) :747-761
[8]  
Balinski Michel L., 1961, Naval Research Logistics Quarterly, V8, P41, DOI DOI 10.1002/NAV.3800080104
[9]  
Ballou R.H., 1992, Business logistics management, V3rd
[10]   A feasibility pump heuristic for general mixed-integer problems [J].
Bertacco, Livio ;
Fischetti, Matteo ;
Lodi, Andrea .
DISCRETE OPTIMIZATION, 2007, 4 (01) :63-76