Filters








3,800 Hits in 4.9 sec

Exact and Heuristic Algorithms for Risk-Aware Stochastic Physical Search

Daniel S. Brown, Jeffrey Hudack, Nathaniel Gemelli, Bikramjit Banerjee
2016 Computational intelligence  
We study Risk-Aware Stochastic Physical Search (RA-SPS), where both the cost to travel and the cost to obtain the item are taken from the same budget, and where the objective is to maximize the probability  ...  We present exact and heuristic algorithms for solving RA-SPS problems on complete metric graphs. We first formulate the problem as mixed integer linear programming problem.  ...  To the best of our knowledge, this work provides the first exact and heuristic algorithmic solutions to Min-Budget and Max-Probability Risk-Aware Stochastic Physical Search (RA-SPS) on complete metric  ... 
doi:10.1111/coin.12098 fatcat:bosjwf3gdzdebcdpy4lfk3u2v4

Multiple Criteria Decision Making Combined with VRP: A Categorized Bibliographic Study

Yahia Zare Mehrjerdi
2015 International Journal of Supply and Operations Management  
Making, Compromise Programming, Surrogate Worth Trade-off Method) and various versions of vehicle routing problem (VRP), Multi depot VRP (MDVRP), VRP with time windows (VRPWTW), Stochastic VRP (SVRP),  ...  This author found that there is no research done in some areas of VRP (i.e., FVRP, ICVRP, LRP and CVRP).  ...  Others have employed hybrids based on evolutionary algorithms and local searches, heuristics, and/or exact methods for the considered problem Doerner et al. 2006; Ehrgott 2000; Jozefowiez et al. 2005;  ... 
doaj:9e4c7d0f2e8f492bade82b93cbd4ebac fatcat:5oj3hokrffcl3b7unsnbg6njgi

Design of reserve networks and the persistence of biodiversity

Mar Cabeza, Atte Moilanen
2001 Trends in Ecology & Evolution  
area solution, in contrast to exact algorithms (such as integer programming techniques) 7 (Box 3).  ...  By the early 1980s, several authors 1,3,4 independently developed iterative heuristic algorithms that attempt to solve the problem of combining sites into representative and efficient networks based on  ...  Inexact heuristics (optimality is not guaranteed and there is no estimate of the quality of the solution) can be divided into iterative heuristics and stochastic global search methods.  ... 
doi:10.1016/s0169-5347(01)02125-5 pmid:11301153 fatcat:ewvnvj5qn5axxn3keuz775zsga

Analytics and Machine Learning in Vehicle Routing Research [article]

Ruibin Bai and Xinan Chen and Zhi-Long Chen and Tianxiang Cui and Shuhui Gong and Wentao He and Xiaoping Jiang and Huan Jin and Jiahuan Jin and Graham Kendall and Jiawei Li and Zheng Lu and Jianfeng Ren and Paul Weng and Ning Xue and Huayan Zhang
2021 arXiv   pre-print
We conclude that ML can be beneficial in enhancing VRP modelling, and improving the performance of algorithms for both online and offline VRP optimisations.  ...  The Vehicle Routing Problem (VRP) is one of the most intensively studied combinatorial optimisation problems for which numerous models and algorithms have been proposed.  ...  Ningbo Science and Technology Bureau (grant numbers 2019B10026, 2017D10034).  ... 
arXiv:2102.10012v1 fatcat:ihs27x2qu5c55fljxuy4fhawgq

Automated Planning and Model Checking (Dagstuhl Seminar 14482)

Alessandro Cimatti, Stefan Edelkamp, Maria Fox, Daniele Magazzeni, Erion Plaku, Marc Herbstritt
2015 Dagstuhl Reports  
Given the description of the initial state, the goal state, and the set of possible actions, a planner uses heuristic search to look for a sequence of actions that transforms the initial state into the  ...  The motivation for this seminar was to increase the synergy between the two research communities, and explore recent progress in the two areas in terms of techniques, tools and formalisms for describing  ...  and explored the possibility of using recent planning tools (heuristic search, sampling-based motion-planning algorithms, symbolic search algorithms, ...) for system falsification (particularly in challenging  ... 
doi:10.4230/dagrep.4.11.227 dblp:journals/dagstuhl-reports/CimattiEFMP14 fatcat:ukc75llezvg2jevqaytqouvzje

Integrated operational supply chain planning in Industry 4.0

Matheus Cardoso Pires, Renato Parreira, Enzo Morosini Frazzon
2021 The International Journal of Integrated Supply Management  
Finally, the following future research opportunities were identified: 1) improving decision-making models to consider stochastic and dynamic behaviours; 2) extending the models to include larger networks  ...  considering environmental impacts; 5) particular models for dealing with limited lifetime products.  ...  Acknowledgements This work is funded by the German Research Foundation (DFG) under reference number FR 3658/1-2 and also by Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES -Brazil) under  ... 
doi:10.1504/ijism.2021.113566 fatcat:3vwqxjfi2ffrfpdl3sjqiisxmi

On green routing and scheduling problem [article]

Nora Touati
2012 arXiv   pre-print
and how they are treated using combinatorial optimization tools.  ...  In this paper, some of the existing literature dealing with routing and scheduling problems with environmental issues is reviewed, and a description is provided of the problems that have been investigated  ...  Evolutionary algorithms are one of the most popular methods for solving multiobjective routing problems [52, 53, 99] , these methods have been hybridized with local searches, heuristics, and/or exact  ... 
arXiv:1203.1604v1 fatcat:l577lwg22reynk3kyctauzs36m

Analysing the Police Patrol Routing Problem: A Review

Maite Dewinter, Christophe Vandeviver, Tom Vander Beken, Frank Witlox
2020 ISPRS International Journal of Geo-Information  
Given the objectives, characteristics, advantages and limitations, the (hybrid) GA, routing policies and local search seem the most valuable solution methods for solving the PPRP.  ...  Processes and Online Stochastic Combinatorial Optimization.  ...  Acknowledgments: The authors thank the three anonymous reviewers for their useful comments.  ... 
doi:10.3390/ijgi9030157 fatcat:galcfjhdanhjzdj37tn5fbngaa

Virtual Network Embedding: A Survey

Andreas Fischer, Juan Felipe Botero, Michael Till Beck, Hermann de Meer, Xavier Hesselbach
2013 IEEE Communications Surveys and Tutorials  
Based upon a novel classification scheme for VNE algorithms a taxonomy of current approaches to the VNE problem is provided and opportunities for further research are discussed.  ...  Application of this technology relies on algorithms that can instantiate virtualized networks on a substrate infrastructure, optimizing the layout for service-relevant metrics.  ...  Instead, it is necessary to avoid mappings that will increase risk for one of the stakeholders. Thus, there is a need for security-aware VNE algorithms.  ... 
doi:10.1109/surv.2013.013013.00155 fatcat:zcao2ncx6nhrnabzunin3jkp4u

Online Risk-Bounded Motion Planning for Autonomous Vehicles in Dynamic Environments [article]

Xin Huang, Sungkweon Hong, Andreas Hofmann, Brian C. Williams
2019 arXiv   pre-print
We update the POMDP model with the intent recognition results in real time and solve it using a heuristic search algorithm which produces policies with upper-bound guarantees on the probability of near  ...  to generate risk-bounded plans for the ego vehicle navigating with a number of dynamic agent vehicles.  ...  Intention-Aware Risk-Bounded Motion Planning In this section, we present an online intention-aware planning algorithm by combining a heuristic forward search method with intent recognition results, as  ... 
arXiv:1904.02341v1 fatcat:mgv4mcotjvc7bcht62ndaoh5su

Determining Solution Space Characteristics for Real-Time Strategy Games and Characterizing Winning Strategies

Kurt Weissgerber, Gary B. Lamont, Brett J. Borghetti, Gilbert L. Peterson
2011 International Journal of Computer Games Technology  
We select a deterministic search technique and a stochastic search method for a priori classification model generation.  ...  An experimental method to determine solution space (search landscape) characteristics is through analysis of historical algorithm performance for solving the specific problem.  ...  Acknowledgment This investigation is a research effort of the AFIT Center for Cyberspace Research (CCR), Director: Dr. Rick Raines.  ... 
doi:10.1155/2011/834026 fatcat:5aowrcrryjfdjikssxbvgnzj3q

Challenges in the Application of Mathematical Programming in the Enterprise-wide Optimization of Process Industries

Ignacio E. Grossmann
2014 Теоретические основы химической технологии  
Retention Spending for Firms with Limited Capacity Anton Ovchinnikov 2 -Use of exact algorithms for Partially Observable Markov Decision Processes in solving a Dynamic Pricing problem Shahin Abbaszadeh  ...  on chip Marc Sevaux, Boureima Zerbo, André Rossi, Jean-Charles Creput 2 -A PSO-based Heuristic for energy-aware scheduling of Workflow applications on cloud computing Sonia Yassa, Rachid Chelouah, Hubert  ...  Patrick Tobin WA-29 Wednesday, 8:30-10:00 CC-A29 Data Mining Chair: Erik Kropat -Exact and heuristic algorithms based on Support Vector Machine for Feature Selection with application to Financial  ... 
doi:10.7868/s0040357114050054 fatcat:kli7aeuyxbaplfhup2t6nmuyxq

Challenges in the application of mathematical programming in the enterprise-wide optimization of process industries

Ignacio E. Grossmann
2014 Theoretical foundations of chemical engineering  
Retention Spending for Firms with Limited Capacity Anton Ovchinnikov 2 -Use of exact algorithms for Partially Observable Markov Decision Processes in solving a Dynamic Pricing problem Shahin Abbaszadeh  ...  on chip Marc Sevaux, Boureima Zerbo, André Rossi, Jean-Charles Creput 2 -A PSO-based Heuristic for energy-aware scheduling of Workflow applications on cloud computing Sonia Yassa, Rachid Chelouah, Hubert  ...  Patrick Tobin WA-29 Wednesday, 8:30-10:00 CC-A29 Data Mining Chair: Erik Kropat -Exact and heuristic algorithms based on Support Vector Machine for Feature Selection with application to Financial  ... 
doi:10.1134/s0040579514050182 fatcat:3ra5yqooyzgmroo5qccbnauftm

Searching for a source without gradients: how good is infotaxis and how to beat it [article]

Aurore Loisy, Christophe Eloy
2022 arXiv   pre-print
We then present three possible ways of beating infotaxis, all inspired by methods used in artificial intelligence: tree search, heuristic approximation of the value function, and deep reinforcement learning  ...  Infotaxis is a popular search algorithm designed to track a source of odor in a turbulent environment using information provided by odor detections.  ...  Centre de Calcul Intensif d'Aix-Marseille is acknowledged for granting access to its high performance computing resources.  ... 
arXiv:2112.10861v2 fatcat:33fqvytdg5f6fpzavoyyst7w6y

Supply chain network design under uncertainty: A comprehensive review and future research directions

Kannan Govindan, Mohammad Fattahi, Esmaeil Keyvanshokooh
2017 European Journal of Operational Research  
Acknowledgment The authors would like to thank the editor and the anonymous reviewers for their invaluable comments which improved this paper significantly.  ...  Articles Solution approach Mathematical model Continuous stochastic parameters Objective Exact algorithm Heuristic algorithm Meta-heuristic Commercial solver Sabri and Beamon (20 0 0)  ...  : 46% , Maximization: 36% ) , Multiple objectives: 18% Table ' ' s summary: Exact algorithms: 3% , Heuristic algorithms: 0% , Meta-heuristics: 18% , Commercial solvers: 79% MILP: 88%, MINLP:  ... 
doi:10.1016/j.ejor.2017.04.009 fatcat:p66d3t5p2najljqxzcxjp33tj4
« Previous Showing results 1 — 15 out of 3,800 results