Filters








5,386 Hits in 7.6 sec

Guest Editorial: Special issue on memetic algorithms with learning strategy

Ling Wang, Liang Feng
2021 Memetic Computing  
the open vehicle routing problem with predetermined time windows under uncertain travel times (OVRP-UT).  ...  The first paper, "A light-robust-optimization model and an effective memetic algorithm for an open vehicle routing problem under uncertain travel times" by Sun et al. presents an effective MA for solving  ...  The proposed method hybridizes an adaptive learning operator with crossover and mutation to enhance the global and local search ability.  ... 
doi:10.1007/s12293-021-00337-6 fatcat:q3gg4vzrnfbh3lrx7s45onuewu

Lion optimization algorithm for team orienteering problem with time window

Esam Taha Yassen, Alaa Abdulkhar Jihad, Sudad H. Abed
2021 Indonesian Journal of Electrical Engineering and Computer Science  
In this paper, the LA is proposed to investigate its performance in solving one of the most popular and widespread real-life optimization problems called team orienteering problem with time windows (TOPTW  ...  As a result of this improving process, an enhanced LA (ILA) emerged. The obtained solutions have been compared with the best known and standard results obtained in the former studies.  ...  The hybridization of the Greedy Randomized Adaptive Search Procedure (GRASP) and Evolutionary Local Search is proposed by Labadie et al [13] for the TOPTW.  ... 
doi:10.11591/ijeecs.v21.i1.pp538-545 fatcat:sslslyswavacjetljx6rjoe6tu

Orienteering Problem: A survey of recent variants, solution approaches and applications

Aldy Gunawan, Hoong Chuin Lau, Pieter Vansteenwegen
2016 European Journal of Operational Research  
A number of typical variants has been studied, such as the Team OP, the (Team) OP with Time Windows and the Time Dependent OP.  ...  The Orienteering Problem (OP) has received a lot of attention in the past few decades.  ...  Souffriau et al. (2013) introduce a hybrid algorithm based on GRASP and ILS, namely GRILS, for solving the Multi-Constraint Team Orienteering Problem with Multiple Time Windows (MC-TOPMTW), a variant  ... 
doi:10.1016/j.ejor.2016.04.059 fatcat:wzehpclce5fbfdzvvehzoxyi7e

A Survey of Transportation Problems

Ocotlán Díaz-Parra, Jorge A. Ruiz-Vanoye, Beatriz Bernábe Loranca, Alejandro Fuentes-Penna, Ricardo A. Barrera-Cámara
2014 Journal of Applied Mathematics  
flow management problem (TFMP), cash transportation vehicle routing problem, and so forth.  ...  problem, truck routing problem, truck transportation problem, vehicle routing problem and variants, convoy routing problem, railroad blocking problem (RBP), inventory routing problem (IRP), air traffic  ...  Iterated local search heuristic [109] Team orienteering problem An algorithm that solves the team orienteering problem with time windows (TOPTW).  ... 
doi:10.1155/2014/848129 fatcat:edckr3vwvvc5rkmzutlm63b7ym

Fuzzy Greedy Randomized Adaptive Search Procedure and Simulation Model to Solve the Team Orienteering Problem with Time Windows [chapter]

Airam Expósito-Márquez, Christopher Expósito-Izquierdo, Belén Melián-Batista, José Marcos Moreno-Vega
2020 Communications in Computer and Information Science  
This problem can be adequately modeled as a Team Orienteering Problem with Time Windows (TOPTW). In this paper we propose a fuzzy GRASP and a multi-agent simulation model to solve the TOPTW.  ...  To do this, he/she must select some of the places according to his/her preferences and design routes to visit them.  ...  Airam Expósito-Márquez would like to thank the Canary Government for the financial support he receives through his post-graduate grant.  ... 
doi:10.1007/978-3-030-50143-3_56 fatcat:gaelt5sos5g2fc4docynpugtca

Solving multi-objective team orienteering problem with time windows using adjustment iterated local search

Indri Hapsari, Isti Surjandari, K. Komarudin
2019 Journal of Industrial Engineering International  
The existing model is the Team Orienteering Problem with Time Window (TOPTW), and the development has been conducted by adding another objective, minimum time, become Flexible TOPTW.  ...  This model guarantees that an effective itinerary with efficient timing to implement will be produced.  ...  Education Research Alliance (SHERA) Program for Universitas Indonesia's Scientific Modeling, Application, Research and Training for City-centered Innovation and Technology (SMART CITY) Project.  ... 
doi:10.1007/s40092-019-0315-9 fatcat:ni2qcdbrhrhwfgro4yy7obsjuu

Advanced decision and intelligence technologies for manufacturing and logistics

Chen-Fu Chien, Kap Hwan Kim, Baoding Liu, Mitsuo Gen
2011 Journal of Intelligent Manufacturing  
(QEA) by combining its principles with some heuristics methods, which is applied to optimize the vehicle routing problem with time windows (VRPTW).  ...  "Scheduling two-stage hybrid flow shops with parallel batch, release time, and machine eligibility constraints" by Wang, Yang and Chang, proposes an efficient dispatching rule called BFIFO that assigns  ... 
doi:10.1007/s10845-011-0559-8 fatcat:w3zjeev5hjce3mgi2pwkzh2y5i

Well-tuned algorithms for the Team Orienteering Problem with Time Windows

Aldy Gunawan, Hoong Chuin Lau, Pieter Vansteenwegen, Kun Lu
2017 Journal of the Operational Research Society  
The Team Orienteering Problem with Time Windows (TOPTW) is the extension of the Orienteering Problem (OP) where each node is limited by a predefined time window during which the service has to start.  ...  We propose two algorithms, Iterated Local Search and a hybridization of Simulated Annealing and Iterated Local Search (SAILS), to solve the TOPTW.  ...  Acknowledgements-This research project is funded by National Research Foundation Singapore under its Corp Lab @ University scheme and Fujitsu Limited.  ... 
doi:10.1057/s41274-017-0244-1 fatcat:2aj6ekej4fcv7gezhwpq4tu7ty

Electric Vehicle Routing, Arc Routing, and Team Orienteering Problems in Sustainable Transportation

Leandro do C. Martins, Rafael D. Tordecilla, Juliana Castaneda, Angel A. Juan, Javier Faulin
2021 Energies  
In particular, we focus on articles related to the well-known vehicle routing, arc routing, and team orienteering problems.  ...  that aim at generating efficient and sustainable routing plans for hybrid fleets, including both electric and internal combustion engine vehicles.  ...  Erasmus+Program (2019-I-ES01-KA103-062602), and the IoF2020-H2020 (731884) project.  ... 
doi:10.3390/en14165131 fatcat:txzytoz5q5h3lj6at5i3nfhscu

Large neighborhoods with implicit customer selection for vehicle routing problems with profits [article]

Thibaut Vidal, Nelson Maculan, Puca Huachi Vaz Penna, Luis Satoru Ochi
2014 arXiv   pre-print
The good performance of these neighborhood structures is demonstrated by extensive computational experiments with a local search, an iterated local search and a hybrid genetic algorithm.  ...  We propose a new neighborhood search for these problems which explores an exponential number of solutions in pseudo polynomial time.  ...  Hybridized evolutionary local search algorithm for the team orienteering problem with time windows. Journal of Heuristics 17(6) 729-753. Lin, S.-W. 2013.  ... 
arXiv:1401.3794v2 fatcat:al5mqsulzrhfpio3uliud3d5mi

Iterated local search algorithm for solving the orienteering problem with soft time windows

Brahim Aghezzaf, Hassan El Fahim
2016 SpringerPlus  
schools for a college team (Butt and Cavalier 1994), delivery of home heating fuel where Abstract In this paper we study the orienteering problem with time windows (OPTW) and the impact of relaxing the  ...  We solve this problem heuristically by considering a hybrid iterated local search.  ...  time horizon which is the case for the OPTW. • We develop a hybrid algorithm that combines an iterated local search with a variable neighborhood search for this specific problem.  ... 
doi:10.1186/s40064-016-3440-6 pmid:27795923 pmcid:PMC5061708 fatcat:pxy7fpnwx5f5rjxjmjrkvvt3h4

Optimizing practical orienteering problems with stochastic time-dependent travel times: towards congestion free routes

Cédric Verbeeck
2016 4OR  
Furthermore, the experience and the knowledge obtained from this study can be used as a pilot to develop new algorithms for the more general class of vehicle routing problems with time-dependent travel  ...  times.  ...  [53] develop an iterated local search (ILS) heuristic for the time-dependent team orienteering problem with time windows (TD-TOPTW) which allows them to illustrate, based on a case study in the city  ... 
doi:10.1007/s10288-016-0324-0 fatcat:xodpicqthjcqhka2yydplkd7k4

A survey on algorithmic approaches for solving tourist trip design problems

Damianos Gavalas, Charalampos Konstantopoulos, Konstantinos Mastakas, Grammati Pantziou
2014 Journal of Heuristics  
(e.g., distances among POIs, visiting time required for each POI, POIs visiting days/hours, entrance fees, weather conditions) and respecting the time available for sightseeing on a daily basis.  ...  The tourist trip design problem (TTDP) refers to a route-planning problem for tourists interested in visiting multiple points of interest (POIs).  ...  Acknowledgement We sincerely thank the anonymous referees for their constructive comments which considerably contributed to improving the presentation and structure of our article.  ... 
doi:10.1007/s10732-014-9242-5 fatcat:4ibq2qusfnfmxaqz6imoiiwnk4

A Review of Performance-Oriented Architectural Design and Optimization in the Context of Sustainability: Dividends and Challenges

Shaoxiong Li, Le Liu, Changhai Peng
2020 Sustainability  
of time.  ...  Performance-oriented architectural design and optimization, as a novel design philosophy and comprehensive evolution technology, has been accepted by architects, engineers, and stakeholders for a period  ...  Acknowledgments: Any opinions, findings, conclusions, or recommendations expressed in this study are those of the authors and do not necessarily reflect the views of the committee.  ... 
doi:10.3390/su12041427 fatcat:xiojtyws7ngn5in3ky5rpm3yz4

Agent-based Evolutionary Computing for Difficult Discrete Problems

Michał Kowol, Aleksander Byrski, Marek Kisiel-Dorohinicki
2014 Procedia Computer Science  
Hybridizing agent-based paradigm with evolutionary computation can enhance the field of metaheuristics in a significant way, giving to usually passive individuals autonomy and capabilities of perception  ...  In the paper as a follow-up to the previous research, an evolutionary multi-agent system (EMAS) is examined in difficult discrete benchmark problems.  ...  The research presented in this paper received partial financial support from AGH University of Science and Technology statutory project.  ... 
doi:10.1016/j.procs.2014.05.093 fatcat:i3qrrsbh75gq7pfhfot4q7ewam
« Previous Showing results 1 — 15 out of 5,386 results