Bi-criteria Convoy Movement Problem

被引：4
|
作者：
Kumar, P. N. Ram [1 ]
Narendran, T. T. [2 ]
Sivakumar, A. I. [1 ]
机构：
[1] Nanyang Technol Univ, Sch MAE, Syst & Engn Management Div, 50 Nanyang Ave, Singapore 639798, Singapore
[2] Indian Inst Technol Madras, Dept Management Studies, Madras, Tamil Nadu, India
来源：
JOURNAL OF DEFENSE MODELING AND SIMULATION-APPLICATIONS METHODOLOGY TECHNOLOGY-JDMS | 2009年 / 6卷 / 03期
关键词：
military convoys; conflicts; peacetime; mathematical models; meta-heuristics;
D O I：
10.1177/1548512909348233
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
The problem of routing and scheduling military convoys adhering to certain constraints is known as the convoy movement problem. This work addresses a bi-criteria model for the peacetime version of the convoy movement problem with minimizing total travel time and travel span as objectives. Two approaches, one based on goal programming and the other based on simulated annealing, are proposed. Encouraging results have been obtained.
引用
收藏
页码：151 / 164
页数：14
相关论文
共 50 条
  • [1] A fuzzy bi-criteria transportation problem
    Keshavarz, Esmaile
    Khorram, Esmaile
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2011, 61 (04) : 947 - 957
  • [2] Approximations of bi-criteria optimization problem
    Luca, Traian Ionut
    Duca, Dorel, I
    [J]. STUDIA UNIVERSITATIS BABES-BOLYAI MATHEMATICA, 2018, 63 (04): : 549 - 559
  • [3] Bi-criteria transportation problem with multiple parameters
    Singh, Sonia
    Singh, Shalabh
    [J]. ANNALS OF OPERATIONS RESEARCH, 2018, 269 (1-2) : 667 - 692
  • [4] A bi-criteria approach for the data association problem
    Hadrien Hugot
    Daniel Vanderpooten
    Jean Michel Vanpeperstraete
    [J]. Annals of Operations Research, 2006, 147 : 217 - 234
  • [5] Bi-criteria transportation problem with multiple parameters
    Sonia Singh
    Shalabh Singh
    [J]. Annals of Operations Research, 2018, 269 : 667 - 692
  • [6] A bi-criteria approach for the data association problem
    Hugot, Hadrien
    Vanderpooten, Daniel
    Vanpeperstraete, Jean Michel
    [J]. ANNALS OF OPERATIONS RESEARCH, 2006, 147 (01) : 217 - 234
  • [7] An improved lower bound for a bi-criteria scheduling problem
    Yan, Jin
    [J]. OPERATIONS RESEARCH LETTERS, 2008, 36 (01) : 57 - 60
  • [8] Global convexity in the bi-criteria Traveling Salesman Problem
    Villagra, Marcos
    Barán, Benjamin
    Gomez, Osvaldo
    [J]. ARTIFICIAL INTELLIGENCE IN THEORY AND PRACTICE, 2006, 217 : 217 - +
  • [9] A bi-criteria multiple-choice secretary problem
    Yu, Ge
    Jacobson, Sheldon Howard
    Kiyavash, Negar
    [J]. IISE TRANSACTIONS, 2019, 51 (06) : 577 - 588
  • [10] Bi-criteria multiple knapsack problem with grouped items
    Castillo-Zunino, Francisco
    Keskinocak, Pinar
    [J]. JOURNAL OF HEURISTICS, 2021, 27 (05) : 747 - 789
12345