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
.
Filters
A GRASP and Path Relinking Heuristic for Rural Road Network Development
2005
Journal of Heuristics
This paper presents a model for rural road network design that involves two objectives: maximize all season road connectivity among villages in a region and maximize route efficiency, while allocating ...
The implementation of GRASP and path relinking includes two novel modifications, a new form of reactive GRASP and a new form of path relinking. ...
Acknowledgment We wish to acknowledge the support of the Research and Special Programs Administration of the U.S.D.O.T. (Contract DTRS56-00-T-0002). ...
doi:10.1007/s10732-005-7000-4
fatcat:msatw4npifajbkgqqijuobflza
GRASP with path relinking for the selective pickup and delivery problem
2016
Expert systems with applications
We present a GRASP with path-relinking for solving the described problem. ...
The proposed heuristic can contribute to the development of effective and efficient algorithms for real world bicycle reposition operations. ...
Thanks are also due to the two anonymous reviewers for their constructive comments. ...
doi:10.1016/j.eswa.2015.12.015
fatcat:eahwrd5kwnh3xbfjbmecxhqa2i
The accessibility arc upgrading problem
2013
European Journal of Operational Research
The accessibility arc upgrading problem (AAUP) is a network upgrading problem that arises in real-life decision processes such as rural network planning. ...
In this paper, we propose a linear integer programming formulation and two solution approaches for this problem. ...
Scaparra and Church (2005) also tackle a road network planning problem, but focus on the rural case for developing countries. ...
doi:10.1016/j.ejor.2012.09.005
fatcat:4mswirweffbpzldbvm3ywxueie
A survey on algorithmic approaches for solving tourist trip design problems
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 MATHEMATICAL MODEL FOR THE CAPACITATED LOCATION-ARC ROUTING PROBLEM WITH DEADLINES AND HETEROGENEOUS FLEET
2019
Transport
Since the CLARP is NP-hard, a Genetic Algorithm (GA) is presented to consider proposed operators, and a constructive heuristic to generate initial solutions. ...
The proposed mixed integer programming model determines a subset of potential depots to be opened, the served roads within predefined deadlines, and the vehicles assigned to each open depot. ...
Reghioui et al. (2007) presented a Greedy Randomized Adaptive Search Procedure (GRASP) with path relinking for a CARPTW in an undirected network. ...
doi:10.3846/transport.2019.11145
fatcat:kg6t4vknijhzfjv6g4pwpjtor4
Solving the Tractor and Semi-Trailer Routing Problem Based on a Heuristic Approach
2012
Mathematical Problems in Engineering
In the TSRP model for this paper, vehicles are dispatched on a trailer-flow network where there is only one main depot, and all tractors originate and terminate in the main depot. ...
We propose a heuristic algorithm to solve the TSRP. The proposed heuristic algorithm first constructs the initial route set by the limitation of a driver's on-duty time. ...
Acknowledgments This work was partially funded by the Science and Technology Plan of Transportation of Shandong Province 2009R58 and the Fundamental Research Funds for the Central Universities YWF-10-02 ...
doi:10.1155/2012/182584
fatcat:ei3quszs2fcpnacqjjhbqkcqfq
Safe and secure vehicle routing: a survey on minimization of risk exposure
2022
International Transactions in Operational Research
Categories (i)-(iv) elaborate on the problem studied, while (v) provides a general concept based on road network characteristics most commonly found in safe and secure routing problems. ...
We review and classify literature in this field and thereby identify a starting point for researchers in this evolving and practically relevant field. ...
The authors use a fuzzy GRASP in combination with path relinking and present their approach with and without fuzzification. ...
doi:10.1111/itor.13130
fatcat:qsadkeinyvbircqlmdmh4y4evy
Orienteering Problem: A survey of recent variants, solution approaches and applications
2016
European Journal of Operational Research
The OP is a routing problem in which the goal is to determine a subset of nodes to visit, and in which order, so that the total collected score is maximized and a given time budget is not exceeded. ...
The most recent applications of the OP, such as the Tourist Trip Design Problem and the mobile-crowdsourcing problem are discussed. Finally, we also present some promising topics for future research. ...
Lu and Shahabi (2015) focus on solving the AOP on a large real road network. The road network is treated as a spatial network. ...
doi:10.1016/j.ejor.2016.04.059
fatcat:wzehpclce5fbfdzvvehzoxyi7e
A Survey of Transportation Problems
2014
Journal of Applied Mathematics
modes (ship, plane, train, bus, truck, Motorcycle, Cars, and others) by air, water, space, cables, tubes, and road. ...
This paper aims at being a guide to understand the different types of transportation problems by presenting a survey of mathematical models and algorithms used to solve different types of transportation ...
GRASP [117] Truck and trailer routing problem A hybrid meta-heuristic based on GRASP, VNS and path relinking. ...
doi:10.1155/2014/848129
fatcat:edckr3vwvvc5rkmzutlm63b7ym
Multi-directional local search
2012
Computers & Operations Research
This paper introduces multi-directional local search, a metaheuristic for multi-objective optimization. We first motivate the method and present an algorithmic framework for it. ...
We conclude that the proposed algorithmic framework is a viable option when solving multi-objective optimization problems. ...
and valuable information, Karl Doerner for his precious advices and useful comments, and Sophie Parragh for her support, help and remarkable patience. ...
doi:10.1016/j.cor.2012.03.010
pmid:25140071
pmcid:PMC4132930
fatcat:q66wvb66yvf6djixstigcr6ixe
Decision Aid Models and Systems for Humanitarian Logistics. A Survey
[chapter]
2013
Decision Aid Models for Disaster Management and Emergencies
This paper introduces the main concepts used in emergency and disaster management, and presents a literature review on the decision aid models and systems applied to humanitarian logistics in this context ...
The number and impact of disasters seems to be increasing in the last decades, and their consequences have to be managed in the best possible way. ...
-Maya and Sörensen [57] describe how to allocate scarce resources to repair a rural road network after it has been damaged by a natural or man-made disaster. -Mehlhorn et al. ...
doi:10.2991/978-94-91216-74-9_2
fatcat:tvqdpbdrrbakzefrtzsda5f7e4
The Vessel Schedule Recovery Problem (VSRP) – A MIP model for handling disruptions in liner shipping
2013
European Journal of Operational Research
, and the travel paths for users between each pair of origins and destinations. ...
In considering the interests of users and investors, the proposed model attempts to determine the number and locations of bike stations, the network structure of bike paths connected between the stations ...
-Optimal Dynamic Tax Evasion: A Portfolio Approach Francesco Menoncin, Economics, Brescia University, Via S. Faustino, 74/B, 25122, Brescia, Italy, menoncin@eco.unibs.it, Rosella Levaggi ...
doi:10.1016/j.ejor.2012.08.016
fatcat:c27kagfnxnhjfbil2rydhjhomm
Optimizing practical orienteering problems with stochastic time-dependent travel times: towards congestion free routes
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 ...
[22] propose a heuristic method based on the greedy randomized adaptive search procedure (GRASP) and path relinking methodologies for the OP that achieve high-quality solutions employing short computing ...
Karbowska-Chilinska and Zabielski [72] propose a hybrid genetic algorithm with path relinking for the OPTW. ...
doi:10.1007/s10288-016-0324-0
fatcat:xodpicqthjcqhka2yydplkd7k4
A Decade of Capacitated Arc Routing
[chapter]
Operations Research/Computer Science Interfaces Series
During the last decade, arc routing has been a relatively active research area with respect to lower bounding procedures, solution approaches and modeling. ...
Arc Routing is the arc counterpart to node routing in the sense that focus regarding service and resource constraints are on the arcs and not on the nodes. ...
Acknowledgement The author would like to thank anonymous referees for their suggestions for improving this chapter. ...
doi:10.1007/978-0-387-77778-8_2
fatcat:vnqzfvcchbdzfjwr33qpf3r63m
Volume Magazine: Art & Science of Real Estate
[article]
2014
Zenodo
To such a degree that the Center for Urban Real Estate sees an opportunity to transform the profession from within, stressing its creative potential and introducing an ethical code. ...
It may be a good moment to dive into the archives and look at some architects' attempts to provide for an open society. How much help do people need? Cite as: Keenan, J.M. (ed.)(2014). ...
These increased costs will accelerate a move away from driving, and cities will have to decide how they will reduce the size of their networks of roads. ...
doi:10.5281/zenodo.5791277
fatcat:dsrkz4mwava37axeab2asuntfm
« Previous
Showing results 1 — 15 out of 31 results