A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Filters
Combining Tabu Search and Genetic Algorithms to Solve the Capacitated Multicommodity Network Flow Problem
2014
Studies in Informatics and Control
Preserved Fulltext
In this article, we present a heuristic solution approach for the well-known capacitated multicommodity network flow problem. ...
Network design has been an important issue in logistics during the last century. ...
In [2] the authors present an efficient procedure using a scatter search framework, which is modified in [3] through an embedded greedy random adaptive search procedure (GRASP). ...
doi:10.24846/v23i3y201405
fatcat:cqy64ygdabbuxnt5zyh5tkfeky
Solving Multicommodity Capacitated Network Design Problems using a Multiobjective Evolutionary Algorithm
2007
2007 IEEE Symposium on Computational Intelligence in Security and Defense Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this research, a multiobjective evolutionary algorithm (MOEA) is used to solve a variation of the multicommodity capacitated network design problem (MCNDP). ...
Evolutionary algorithms have been applied to a variety of network flow problems with acceptable results. ...
Alvarez et al [1] used a greedy randomized adaptive search procedure (GRASP) embedded scatter search to solve the MCNDP. ...
doi:10.1109/cisda.2007.368132
dblp:conf/cisda/KleemanLHG07
fatcat:ofarwma6lbf3ljpyaou6t2zaqu
An annotated bibliography of GRASP-Part II: Applications
2009
International Transactions in Operational Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for combinatorial optimization. ...
GRASP has been applied to a wide range of combinatorial optimization problems, ranging from scheduling and routing to drawing and turbine balancing. ...
Hybrid scatter search and path relinking for the capacitated p-median problem. European J. of Operational Research, 169:570-585, 2006. ...
doi:10.1111/j.1475-3995.2009.00664.x
fatcat:wdqwc6xvcnfq3fi5ujy6jy5wtm
A GRASP with path-relinking for private virtual circuit routing
2003
Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
We propose variants of a GRASP with path-relinking heuristic for this problem. ...
In this paper, the offline PVC routing problem is formulated as an integer multicommodity flow problem with additional constraints and with an objective function that minimizes delays and network overload ...
[10] studied a network configuration problem in telecommunications, searching for paths in a capacitated network to accommodate a given traffic demand matrix. ...
doi:10.1002/net.10065
fatcat:fkm3qi4agjdyxbb4va2jhnmcwe
Hybrid GRASP Heuristics
[chapter]
2009
Studies in Computational Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
This chapter gives an overview of different ways to hybridize GRASP (Greedy Randomized Adaptive Search Procedures) to create new and more effective metaheuristics. ...
themselves, especially when solving difficult real-world combinatorial optimization problems. ...
[6] proposed a GRASP embedded scatter search for the multicommodity capacitated network design problem. ...
doi:10.1007/978-3-642-01085-9_4
fatcat:xmrpoff3hbhrvnhzgjvth46ioa
Parallel Metaheuristics Applications
[chapter]
2005
Parallel Metaheuristics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
1 2 PARALLEL META-HEURISTICS APPLICATIONS problems, set covering and partitioning, satisfiability and max-sat problems, quadratic assignment, location and network design, traveling salesman and vehicle ...
and Tabu Search, while some others address the field in more comprehensive terms: ...
Acknowledgments Funding for this project has been provided by the Natural Sciences and Engineering Council of Canada, and by the Fonds FQRNT of the Province of Québec. ...
doi:10.1002/0471739383.ch19
fatcat:junbparoinckhfulturvyqvuxu
A Comprehensive Review on Scatter Search: Techniques, Applications, and Challenges
2021
Mathematical Problems in Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
In this paper, an updated review of scatter search (SS) is given. SS has been successfully applied in a variety of research problems, namely, data mining, bioinformatics, and engineering design. ...
Among others, scatter search is the widely used evolutionary metaheuristic algorithm. It uses the information of global optima, which is stored in a different and unique set of solutions. ...
and capacitated multicommodity network design. ...
doi:10.1155/2021/5588486
fatcat:5jp5d7xlezhkrcgcf3pvvxw7rq
Efficient metaheuristics to solve the intermodal terminal location problem
2012
Computers & Operations Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Determining the optimal number and location of intermodal transshipment terminals is a decision that strongly influences the viability of the intermodal transportation alternative. ...
An argument in favor of the ABHC approach is that it is parameter-free and hence more transparent and likely to be accepted in a business or policy environment. 20 ...
The multicommodity capacitated (fixed charge) network design problem (MCNDP) (Crainic 150 et al., 2001; Frangioni and Gendron, 2009) , in which a set of demands have to be routed through a network, shows ...
doi:10.1016/j.cor.2011.10.005
fatcat:sff6randyvczvch3duoue7siki
Strategies for the Parallel Implementation of Metaheuristics
[chapter]
2002
Operations Research/Computer Science Interfaces Series
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
Parallel implementations of metaheuristics appear quite naturally as an effective alternative to speed up the search for approximate solutions of combinatorial optimization problems. ...
Parallel implementations of tabu search, GRASP, genetic algorithms, simulated annealing, and ant colonies are reviewed and discussed to illustrate the main strategies used in the parallelization of different ...
Crainic and Gendreau [59] have also implemented a cooperative multiple-walk parallel tabu search for the fixed charge, capacitated, multicommodity network design problem, which is shown to outperform ...
doi:10.1007/978-1-4615-1507-4_13
fatcat:syvr7spvynhntdp6ya44ntlimq
Parallel Meta-heuristics
[chapter]
2010
International Series in Operations Research and Management Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The same approach was applied to the fixed
cost, capacitated, multicommodity network design problem with similar results [32]. ...
A First Multilevel Cooperative Algorithm for
the Capacitated Multicommodity Network Design. Computers & Operations Research,
33(9):2602–2622, 2006. ...
doi:10.1007/978-1-4419-1665-5_17
fatcat:5hhwwngx6jb6pnaugdgvenjraq
Parallel Metaheuristic Search
[chapter]
2018
Handbook of Heuristics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We present a general picture of the parallel meta-heuristic search for optimization. ...
global guidance of the search. ...
University, Vietnam, who collaborated over the years to the work on parallel meta-heuristics for combinatorial optimization. ...
doi:10.1007/978-3-319-07124-4_40
fatcat:2hpzacmchre2hbdksb5sgav6ii
Further Research on Node Based Bottleneck Improvement Problem for Multicut
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Topics of interest are found in all fields of combinatorial optimization, e.g. logistics, production, scheduling, resource and operations management, flexible manufacturing, VLSI design, network design ...
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. ...
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
2021
Applied Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
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. ...
Finally, the trend and future outlook of VRP for the suggested humanitarian operations are discussed and highlighted. ...
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
Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization
[chapter]
2008
Studies in Computational Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Several different ways exist for approaching hard optimization problems. ...
The crucial issue is how mathematical programming methods and metaheuristics should be combined for achieving those benefits. Many approaches have been proposed in the last few years. ...
National ICT Australia is funded by the Australian Government's Backing Australia's Ability initiative, in part through the Australian Research Council. ...
doi:10.1007/978-3-540-78295-7_2
fatcat:lenuq54xgzfktottkd6odh22qy
The Vessel Schedule Recovery Problem (VSRP) – A MIP model for handling disruptions in liner shipping
2013
European Journal of Operational Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We formulate and analyze a strategic design model for public bicycle sharing systems with service level considerations. ...
for the optimization of plants and entire supply chains that are involved in EWO problems. ...
We consider a new network design problem that arises in the design of last mile telecommunication networks and combines the capacitated network design problem with the single-source capacitated facility ...
doi:10.1016/j.ejor.2012.08.016
fatcat:c27kagfnxnhjfbil2rydhjhomm
« Previous
Showing results 1 — 15 out of 23 results