Bi-objective orienteering for personal activity scheduling

被引:9
|
作者
Matl, Piotr [1 ]
Nolz, Pamela C. [2 ]
Ritzinger, Ulrike [2 ]
Ruthmair, Mario [3 ]
Tricoire, Fabien [1 ]
机构
[1] Univ Vienna, Dept Business Adm, Oskar Morgenstern Pl 1, A-1090 Vienna, Austria
[2] Austrian Inst Technol, Mobil Dept Dynam Transportat Syst, Giefinggasse 2, A-1210 Vienna, Austria
[3] Univ Vienna, Dept Stat & Operat Res, Oskar Morgenstern Pl 1, A-1090 Vienna, Austria
关键词
Bi-objective metaheuristics; Large neighborhood search; Orienteering; Personal planning; MULTIPLE TIME WINDOWS; EPSILON-CONSTRAINT METHOD; COMBINATORIAL OPTIMIZATION; LOCAL SEARCH; PROFITS;
D O I
10.1016/j.cor.2017.01.009
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We propose and solve a rich, bi-objective extension of the orienteering problem with time windows (OPTW) to model a combined routing and scheduling problem. Our research is motivated by the problem faced by mobile freelancers who have to integrate irregular appointments and tasks into their daily routines. Those people have a number of tasks which they need to perform at various locations (e.g. meetings with different clients), subject to varying time constraints (e.g. opening hours), and with different levels of importance or urgency (e.g. submitting a deliverable versus cleaning the home office). Furthermore, sets of related tasks may be subject to precedence relations and time dependencies. We explicitly consider the trade-off between planning more tasks and enjoying more free time by means of a bi-objective model. The extension of the OPTW and the bi-objective formulation result in the Personal Planning Problem (PPP). We present a mathematical formulation of the PPP and a metanduristic based on Large Neighborhood Search (LNS) is developed to generate a set of non-dominated solutions to the problem. Solution quality is analyzed on real-world-inspired test instances. Exact reference sets based on a linear single-commodity flow model are used as benchmarks. Extensive computational experiments show that the proposed metaheuristic generates near-optimal solution sets and scales well to larger instances. (C) 2017 Elsevier Ltd. All rights reserved.
引用
收藏
页码:69 / 82
页数:14
相关论文
共 50 条
  • [1] Metaheuristics for the bi-objective orienteering problem
    Schilde M.
    Doerner K.F.
    Hartl R.F.
    Kiechle G.
    Swarm Intelligence, 2009, 3 (3) : 179 - 201
  • [2] Local Search Effects in Bi-Objective Orienteering
    Bossek, Jakob
    Grimme, Christian
    Meisel, Stephan
    Rudolph, Gunter
    Trautmann, Heike
    GECCO'18: PROCEEDINGS OF THE 2018 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2018, : 585 - 592
  • [3] Bi-Objective version of Team Orienteering Problem (BTOP)
    HajMirzaei, Milad
    Ziarati, Koorush
    Naghibi, Mohammad-Taghi
    PROCEEDINGS OF THE 2017 7TH INTERNATIONAL CONFERENCE ON COMPUTER AND KNOWLEDGE ENGINEERING (ICCKE), 2017, : 1 - 7
  • [4] The bi-objective orienteering problem with budget constraint: GRASP_ILS
    Rezki, Hasnaa
    Aghezzaf, Brahim
    2017 INTERNATIONAL COLLOQUIUM ON LOGISTICS AND SUPPLY CHAIN MANAGEMENT (LOGISTIQUA), 2017, : 25 - 30
  • [5] Bi-objective scheduling on two dedicated processors
    Kacem, Adel
    Dammak, Abdelaziz
    EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING, 2019, 13 (05) : 681 - 700
  • [6] A Bi-Objective Paediatric Operating Theater Scheduling
    Dekhici, Latifa
    Belkadi, Khaled
    INTERNATIONAL JOURNAL OF HEALTHCARE INFORMATION SYSTEMS AND INFORMATICS, 2023, 18 (01)
  • [7] A bi-objective evolutionary approach to robust scheduling
    Surico, Michele
    Kaymak, Uzay
    Naso, David
    Dekker, Rommert
    2007 IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS, VOLS 1-4, 2007, : 1637 - +
  • [8] Bi-objective scheduling on a restricted batching machine
    Cabo, Marta
    Luis Gonzalez-Velarde, Jose
    Possani, Edgar
    Rios Solis, Yasmin A.
    COMPUTERS & OPERATIONS RESEARCH, 2018, 100 : 201 - 210
  • [9] Multi-Objective Artificial Bee Colony algorithm applied to the bi-objective orienteering problem
    Martin-Moreno, Rodrigo
    Vega-Rodriguez, Miguel A.
    KNOWLEDGE-BASED SYSTEMS, 2018, 154 : 93 - 101
  • [10] The Non-Smooth and Bi-Objective Team Orienteering Problem with Soft Constraints
    Estrada-Moreno, Alejandro
    Ferrer, Albert
    Juan, Angel A.
    Panadero, Javier
    Bagirov, Adil
    MATHEMATICS, 2020, 8 (09)