31 Hits in 16.7 sec

The capacitated m two node survivable star problem

Gabriel Bayá, Antonio Mauttone, Franco Robledo
2017 Yugoslav Journal of Operations Research  
We propose a combinatorial optimization problem called CmTNSSP (Capacitated m Two-Node-Survivable Star Problem), a relaxation of CmRSP (Capacitated m Ring Star Problem).  ...  In this variant of CmRSP, the rings are not constrained to be cycles; instead, they can be two-node connected components.  ...  Robledo / The Capacitated m Two Node Survivable Star Problem  ... 
doi:10.2298/yjor151115015b fatcat:jaygg3akrbfg5h6totuwz43ecm

Metaheuristics and Their Hybridization to Solve the Bi-objective Ring Star Problem: a Comparative Study [article]

Arnaud Liefooghe, Laetitia Jourdan, El-Ghazali Talbi (LIFL, INRIA Lille - Nord Europe)
2008 arXiv   pre-print
This paper presents and experiments approaches to solve a new bi-objective routing problem called the ring star problem.  ...  It consists of locating a simple cycle through a subset of nodes of a graph while optimizing two kinds of cost.  ...  Acknowledgment A subpart of this work has already been published in [40] . The authors would like to gratefully acknowledge Matthieu Basseur and Edmund K. Burke for their helpful contribution.  ... 
arXiv:0804.3965v2 fatcat:lv7ulxaqejhafm4tdlkw5bqjii


Danilo César Azeredo Silva, Mário Mestria
2018 Pesquisa Operacional  
In the present work, we utilize the CRO metaheuristic to solve, in an efficient manner, the capacitated p-median problem, in order to locate service stations.  ...  Chemical Reaction Optimization (CRO) is a metaheuristic for solving optimization problems, which mimics the interactions between molecules in a chemical reaction with the purpose of achieving a stable,  ...  The CPMP can be found in the literature under various different names, such as the capacitated warehouse location problem, the sum-of-stars clustering problem, the capacitated clustering problem, and others  ... 
doi:10.1590/0101-7438.2018.038.03.0441 fatcat:hkn6ucwjxrcx5p6aoilidspuam

Solving Capacitated Location Routing Problem by Variable Neighborhood Descent and GA-Artificial Neural Network Hybrid Method

Engin Pekel, Selin Soner Kara
2018 Promet (Zagreb)  
A novel multi-stage approach, which is performed to lower transportation cost, is carried out in CLRP.  ...  The capacitated location-routing problem (CLRP), which has been practiced by various methods, is performed to find the optimal depot locations and routings by additionally using the artificial neural network  ...  VARIABLE NEIGHBORHOOD SEARCH FOR THE CLRP Various methods have been applied in LRP. Variable neighborhood search (VNS) is a metaheuristic method for solving several difficult problems.  ... 
doi:10.7307/ptt.v30i5.2640 fatcat:qxkgspug25bcjemtrjgx5itwmu

Further Research on Node Based Bottleneck Improvement Problem for Multicut [chapter]

Xiucui Guan, Jie Su
2006 Lecture Notes in Computer Science  
Theme: ECCO is the annual meeting of the EURO working group on combinatorial optimization. ECCO was started in 1987 by a group of leading experts in Operations Research and Management Science.  ...  ECCO wants to provide a forum for researchers in combinatorial optimization, either in its theoretical aspects or in business, industry or public administration applications.  ...  The p-Center problem consists in locating p facilities among a set of M possible locations and assigning N clients to them in order to minimize the maximum distance between a client and the facility to  ... 
doi:10.1007/11816157_107 fatcat:xjdnf4kesrbczoh4ilvxxixqei

Vehicle Routing Optimisation in Humanitarian Operations: A Survey on Modelling and Optimisation Approaches

Wadi Khalid Anuar, Lai Soon Lee, Stefan Pickl, Hsin-Vonn Seow
2021 Applied Sciences  
This paper focuses on the branch of a well-known OR problem, known as the Vehicle Routing Problem (VRP), within the selected scope of humanitarian operations.  ...  The inclusion of a machine learning solution approach under the same classification is proposed.  ...  Conflicts of Interest: The authors declare no conflict of interest. Abbreviations The following abbreviations are used in this manuscript:  ... 
doi:10.3390/app11020667 fatcat:vo7i2wwz7vevvohbzqyn7v72ke

Contributions to the development of the CRO-SL algorithm: Engineering applications problems [article]

Carlos Camacho-Gómez
2018 arXiv   pre-print
Also, we discuss a problem of vibration cancellation over structures of two and four floors, using Tuned Mass Dampers (TMD's).  ...  The problems that can be tackled with meta-heuristic approaches is very wide and varied, and it is not exclusive of engineering.  ...  hybridization of the CRO-SL.  ... 
arXiv:1807.10562v1 fatcat:ilkllhikuffqhm6zx6m3mg5vfq

Variable Neighborhood Search and GRASP for Three-Layer Hierarchical Ring Network Design [chapter]

Christian Schauer, Günther R. Raidl
2012 Lecture Notes in Computer Science  
We present tailored Variable Neighborhood Search (VNS) and GRASP approaches to solve large instances of this problem heuristically, and discuss computational results indicating the VNS' superiority.  ...  The aim is to connect nodes that are assigned to three different layers using rings of bounded length.  ...  To solve this problem the authors present two stabilized column generation approaches. The Capacitated m-Ring-Star Problem was introduced by Baldacci et al. in [4] .  ... 
doi:10.1007/978-3-642-32937-1_46 fatcat:5ekdji3d5rgp3ptj4lu3weck34

The Vessel Schedule Recovery Problem (VSRP) – A MIP model for handling disruptions in liner shipping

Berit D. Brouer, Jakob Dirksen, David Pisinger, Christian E.M. Plum, Bo Vaaben
2013 European Journal of Operational Research  
Multi-objective (MO) route selection problem is a combination of two combinatorial problems: MO shortest path problem (finding the efficient paths between the nodes to be visited) and MO traveling salesperson  ...  We develop an interactive approach that helps in finding the best solution of a decision maker who has a quasiconcave utility function.  ...  -Optimal Dynamic Tax Evasion: A Portfolio Approach Francesco Menoncin, Economics, Brescia University, Via S. Faustino, 74/B, 25122, Brescia, Italy,, Rosella Levaggi  ... 
doi:10.1016/j.ejor.2012.08.016 fatcat:c27kagfnxnhjfbil2rydhjhomm

A two-stage heuristic for the university course timetabling problem [chapter]

Máté Pintér, Balázs Dávid
2019 StuCoSReC. Proceedings of the 2019 6th Student Computer Science Research Conference  
Acknowledgments The authors acknowledge the financial support from the Slovenian Research Agency (Research Core Funding No. P2-0057).  ...  Hybridizing meta-heuristics approaches for solving university course timetabling problems. In P. Lingras, M. Wolski, C. Cornelis, S. Mitra, and P.  ...  Itc2007 solver description: a hybrid approach. Annals of Operations Research, 172(1):429, 2009. [12] K. Shaker, S. Abdullah, A. Alqudsi, and H. Jalab.  ... 
doi:10.26493/978-961-7055-82-5.27-30 fatcat:mv36atnxqvczjg7m7aetrpvy6y

Parallel Meta-heuristics [chapter]

Teodor Gabriel Crainic, Michel Toulouse
2010 International Series in Operations Research and Management Science  
A Parallel Hybrid Evolutionary MetaHeuristic for the Vehicle Routing Problem with Time Windows. In K. Miettinen, M.M. M akel]:a, and J.  ...  ., Lucka, M., and Reimann, M. Parallel Ant Sys- tems for the Capacitated Vehicle Routing Problem.  ... 
doi:10.1007/978-1-4419-1665-5_17 fatcat:5hhwwngx6jb6pnaugdgvenjraq

Automatic planning of 3G UMTS all-IP release 4 networks with realistic traffic

Mohammad Reza Pasandideh, Marc St-Hilaire
2013 Computers & Operations Research  
A new mathematical model for the design problem of such architecture was proposed.  ...  Two approximate algorithms based on the local search and tabu search principles are adopted to solve the problem. Numerical results show that "good" solutions are found with the proposed heuristics.  ...  There are two major methods to approach a network design problem.  ... 
doi:10.1016/j.cor.2013.02.017 fatcat:epcx33g4qrcpvji2alexo3g5vm

14th International Symposium on Mathematical Programming

1990 Mathematical programming  
If we use a decomposition approach in order to solve a minimization problem we often get an objective function in such a w a y that its domain dom 6 = n is not given explicitely to us.  ...  Finally I report numerical results of a comparison between the variant and a minimization approach using penalty functions.  ...  The capacities of the bers are very large, but they are limited. Therefore we m ust consider the capacitated version of the problem. In addition, survivability has become an important issue.  ... 
doi:10.1007/bf01580875 fatcat:3jtclwmntzgjxkqs5uecombdaa

International Journal of Supply and Operations Management IJSOM Using Metaheuristic Algorithms for Solving a Hub Location Problem: Application in Passive Optical Network Planning

Masoud Rabbani, Mohammad Ravanbakhsh, Hamed Farrokhi-Asl, Mahyar Taheri
2017 unpublished
is a ring and the access networks has a star-star topology.  ...  (GA) in large-scaled problems and the results of two algorithms are compared with respect to computational time and objective function obtained value.  ...  Saboury et al. (2013) proposed a new mathematical formulation for a two-level network by full connection in each level using two hybrid algorithms.  ... 

Welcome message from the General Chairs

Giovanni Giambene, Boon Sain Yeo
2009 2009 International Workshop on Satellite and Space Communications  
Each paper was reviewed by at least two reviewers (most papers received three reviews each).  ...  This year we received a total of 153 high-quality papers from more than 20 countries. Many papers demonstrated notable systems with good analytical and/or empirical analyses.  ...  During the survival competition, the survived cuckoo societies immigrate to a better environment and restart the process.  ... 
doi:10.1109/iwssc.2009.5286448 fatcat:wcu4uzasizhzjmdkzyekynnqwi
« Previous Showing results 1 — 15 out of 31 results