The vehicle routing problem: A taxonomic review

Ekşioğlu, Burak; Vural, Arif Volkan; Reisman, Arnold

doi:10.1016/j.cie.2009.05.009

Cited by 597 publications

(307 citation statements)

References 56 publications

Supporting

Mentioning

288

Contrasting

Unclassified

Order By: Relevance

“…Due to recent advances in these technologies, they can now be implemented at lower costs and at a larger scale [21]. One can refer to [6,14,21] for complete reviews on the recent literature on the vehicle routing problems, and [23,24] for stochastic and dynamic vehicle routing problems.…”

Section: Literature Reviewmentioning

confidence: 99%

A look-ahead partial routing framework for the stochastic and dynamic vehicle routing problem

Zou

Dessouky

2018

J Veh Routing Algorithms

View full text Add to dashboard Cite

In this paper, we study the vehicle routing problem with dynamic customers, where a portion of the customer requests are known in advance and the rest arrive in real time. We propose an optimization-based look-ahead dynamic routing framework that involves request forecasting, partial planning, and dynamic real-time routing of the fleet. This framework has the capabilities for adjustments in response to routing environments with different levels of uncertainties. Through extensive numeral simulations, we exam its performance in routing environments with various levels of uncertainties. We demonstrate the efficiency and robustness of the proposed solution by benchmarking against two other routing strategies. This paper fills the gap in the literature on studying the relationship between the level of route planning in the solution approach and the quality of the solution under various system conditions.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

A look-ahead partial routing framework for the stochastic and dynamic vehicle routing problem

Zou

Dessouky

2018

J Veh Routing Algorithms

View full text Add to dashboard Cite

show abstract

“…Eksioglu et al (2009) King e Logan (1964) para localizar e dimensionar as plantas de abates de bovinos da Califórnia. Zucchi et al (2011) apresentam um modelo matemático dinâmico para determinar a localização de frigoríficos com base nos custos de instalação e transporte.…”

Section: Referencial Teóricounclassified

Um modelo para a logística do abate do gado de corte

Ribeiro¹,

Oliveira²,

Filho³

2018

PODes

View full text Add to dashboard Cite

RESUMONeste artigo é apresentado um modelo matemático linear em variáveis inteiras para auxiliar o produtor rural a determinar a solução mais rentável, escolhendo o melhor frigorífico, a melhor estrada e o melhor caminhão para realizar o transporte das cabeças de gado para o abate. O modelo proposto leva em consideração a capacidade dos frigoríficos e dos caminhões disponíveis, bem como as diferentes rotas para efetuar o transporte do gado. Nos testes realizados, o modelo proposto foi resolvido pela versão gratuita do software LINGO. Os resultados obtidos foram superiores ou iguais àqueles fornecidos pelo método manual de tomada de decisão empregado pelos técnicos da fazenda.Palavras-chave: Transporte, Manejo, Bem-estar animal, Otimização. ABSTRACTThis paper presents a linear mathematical model in integer variables to help the rural producer to determine the most profitable solution, by choosing the best slaughter plant, the best road and the best truck to carry the livestock for slaughtering. The model proposed takes into account the capacity of the slaughter plants and trucks available, as well as the different routes to transport the cattle. In the tests performed, the model was solved by the free version of LINGO. The results obtained were better than or equal to those provided by the manual decision-making method used by the farm technicians.

show abstract

“…These and their solution methods are discussed in several surveys by Solomon and Desrosiers (1988), Laporte (1992), Parragh, Doerner, and Hartl (2008), Eksioglu, Vural andReisman (2009), Toth andVigo (2002), as well as a 50th anniversary survey by Laporte Given the vast number of possible scenarios, vehicles, customer requirement characteristics and constraints, it is practical to focus on the main and relevant variants for the purpose of this literature review. Broad classification schemes and naming convention have been given by Desrochers, Lenstra, and Savelsbergh (1990), Berbeglia, Cordeau, Gribkovskaia, Laporte's 3-field scheme (2007a;2007b), Marinakis &Migdalas (2007, and Hosny (2010).…”

Section: Vrp Variantsmentioning

confidence: 99%

“…While thousands of papers have been published for the latter, e.g., survey papers by Solomon and Desrosiers (1988), Laporte (1992), Eksioglu, Vural &Reisman (2009), Toth andVigo (2002) and the survey paper in the 50th anniversary of the VRP by Laporte (2009), research on VRPPD is relatively scant (Savelsbergh & Sol, 1995). One contributing factor is the complexity of such problems and the difficulty in handling the underlying constraints.…”

Section: Vrp With Pickup and Delivery (Vrppd)mentioning

confidence: 99%

Heuristics for Solving Problem of Evacuating Non-Ambulatory People in a Short-Notice Disaster

Pico¹,

Tan²

2012

View full text Add to dashboard Cite

Public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instruction, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing this burden, to ABSTRACT (maximum 200 words)As Humanitarian Assistance and Disaster Relief (HADR) operations gain importance, a number of problems become evident. The time-sensitive problem of evacuating non-ambulatory people from a disaster area proves to be a challenging combinatorial optimization problem. The scope of the problem is defined by drawing analogies to similar vehicle routing problems that have been previously addressed. Based on the basic Max-Min Ant System (MMAS) algorithm modeled after the behavior of ants seeking food, potential solution approaches to this problem are enhanced to improve quality and efficiency by hybridizing features such as a best solution list, elite ants, ranked contribution system, and heuristic procedures during route construction. Using a Nearly-Orthogonal Latin Hypercubes (NOLH) experimental design, the algorithm parameters are tuned for best empirical performance for a range of test scenarios. SUBJECT TERMS HEURISTICS FOR SOLVING PROBLEM OF EVACUATING NON-AMBULATORY PEOPLE IN A SHORT-NOTICE DISASTER

show abstract

The vehicle routing problem: A taxonomic review

Cited by 597 publications

References 56 publications

A look-ahead partial routing framework for the stochastic and dynamic vehicle routing problem

A look-ahead partial routing framework for the stochastic and dynamic vehicle routing problem

Um modelo para a logística do abate do gado de corte

Heuristics for Solving Problem of Evacuating Non-Ambulatory People in a Short-Notice Disaster

Contact Info

Product

Resources

About