Relevant bibliographies by topics / Vehicle routing software

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Vehicle routing software'

Author: Grafiati
Published: 4 June 2021
Last updated: 7 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Vehicle routing software.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Vehicle routing software"

1

Golden, Bruce L., Lawrence Bodin, and Terry Goodwin. "Microcomputer-based vehicle routing and scheduling software." Computers & Operations Research 13, no. 2-3 (January 1986): 277–85. http://dx.doi.org/10.1016/0305-0548(86)90012-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Letchford, Adam N., and Juan-José Salazar-González. "Projection results for vehicle routing." Mathematical Programming 105, no. 2-3 (October 12, 2005): 251–74. http://dx.doi.org/10.1007/s10107-005-0652-x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

GUPTA, ARVIND, and RAMESH KRISHNAMURTI. "PARALLEL ALGORITHMS FOR VEHICLE ROUTING PROBLEMS." Parallel Processing Letters 13, no. 04 (December 2003): 673–87. http://dx.doi.org/10.1142/s0129626403001598.

Full text
Abstract:
Vehicle routing problems involve the navigation of one or more vehicles through a network of locations. Locations have associated handling times as well as time windows during which they are active. The arcs connecting locations have time costs associated with them. In this paper, we consider two different problems in single vehicle routing. The first is to find least time cost routes between all pairs of nodes in a network for navigating vehicles; we call this the all pairs routing problem. We show that there is an O( log 3 n) time parallel algorithm using a polynomial number of processors for this problem on a CREW PRAM. We next consider the problem in which a vehicle services all locations in a network. Here, locations can be passed through at any time but only serviced during their time window. The general problem is [Formula: see text] -complete under even fairly stringent restrictions but polynomial algorithms have been developed for some special cases. In particular, when the network is a line, there is no time cost in servicing a location, and all time windows are unbounded at either their lower or upper end, O(n2) algorithms have been developed. We show that under the same conditions, we can reduce this problem to the all pairs routing problem and therefore obtain an O( log 3 n) time parallel algorithm on a CREW PRAM.
APA, Harvard, Vancouver, ISO, and other styles
4

Amalia, Atika Dwi Hanun, Herry Suprajitno, and Asri Bekti Pratiwi. "Solving Close-Open Mixed Vehicle Routing Problem Using Bat Algorithm." Contemporary Mathematics and Applications (ConMathA) 2, no. 1 (May 20, 2020): 46. http://dx.doi.org/10.20473/conmatha.v2i1.19301.

Full text
Abstract:
The purpose of this research is to solve the Close-Open Mixed Vehicle Routing Problem (COMVRP) using Bat Algorithm. COMVRP which is a combination of Close Vehicle Routing Problem or commonly known as Vehicle Routing Problem (VRP) with Open Vehicle Routing Problem (OVRP) is a problem to determine vehicles route in order to minimize total distance to serve customers without exceed vehicle capacity. COMVRP occurs when the company already has private vehicles but its capacity could not fulfill all customer demands so the company must rent several vehicles from other companies to complete the distribution process. In this case, the private vehicle returns to the depot after serving the last customer while the rental vehicle does not need to return. Bat algorithm is an algorithm inspired by the process of finding prey from small bats using echolocation. The implementation program to solve was created using Java programming with NetBeans IDE 8.2 software which was implemented using 3 cases, small data with 18 customers, medium data with 75 customers and large data with 100 customers. Based on the implementation results, it can be concluded that the more iterations, the smaller total costs are obtained, while for the pulse rate and the amount of bat tends not to affect the total cost obtained.
APA, Harvard, Vancouver, ISO, and other styles
5

Kaku, Ikou, Yiyong Xiao, and Guoping Xia. "The Deterministic Annealing Algorithms for Vehicle Routing Problems." International Journal of Smart Engineering System Design 5, no. 4 (October 2003): 327–39. http://dx.doi.org/10.1080/10255810390224080.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Sztajerowski, Wiktor, Joanna Ochelska-Mierzejewska, and Jacek Kucharski. "SYSTEM FOR VEHICLE ROUTING PROBLEM ALGORITHMS ANALYSIS." Informatics Control Measurement in Economy and Environment Protection 7, no. 2 (June 30, 2017): 28–31. http://dx.doi.org/10.5604/01.3001.0010.4833.

Full text
Abstract:
Paper concerns the software system supporting the analysis of different cases of solving VRP by various algorithms. VRP has been characterised and application structure has been presented. Illustrative experimental results show the usefulness of the system.
APA, Harvard, Vancouver, ISO, and other styles
7

AbdAllah, Abdel Monaem F. M., Daryl L. Essam, and Ruhul A. Sarker. "On solving periodic re-optimization dynamic vehicle routing problems." Applied Soft Computing 55 (June 2017): 1–12. http://dx.doi.org/10.1016/j.asoc.2017.01.047.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Altabeeb, Asma M., Abdulqader M. Mohsen, Laith Abualigah, and Abdullatif Ghallab. "Solving capacitated vehicle routing problem using cooperative firefly algorithm." Applied Soft Computing 108 (September 2021): 107403. http://dx.doi.org/10.1016/j.asoc.2021.107403.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Yuliza, Evi, Fitri Maya Puspita, and Siti Suzlin Supadi. "The robust counterpart open capacitated vehicle routing problem with time windows on waste transport problems." Bulletin of Electrical Engineering and Informatics 9, no. 5 (October 1, 2020): 2074–81. http://dx.doi.org/10.11591/eei.v9i5.2439.

Full text
Abstract:
The optimum route for garbage transport vehicles is restricted by vehicle capacity and time windows that the garbage transport vehicle starts at the origin and does not return to the origin. The problem of transporting waste routes is a robust optimization problem where the amount of waste in an area and travel time is uncertain. In the real world, traffic jams and vehicle engine damage can cause delays. This paper proposes the robust counterpart open capacitated vehicle routing problem (denoted by RCOCVRP) with soft time windows model. The aim of RCOCVRP with soft time windows model is to find schedule and optimum route of transporting waste. This model calculation uses LINGO software and GAMS software. Finally for the evaluation of the RCOCVRP model with soft time windows on the proposed waste transportation problem is conducted so that it hasa feasible solution.
APA, Harvard, Vancouver, ISO, and other styles
10

Cornuejols, Gerard, and Farid Harche. "Polyhedral study of the capacitated vehicle routing problem." Mathematical Programming 60, no. 1-3 (June 1993): 21–52. http://dx.doi.org/10.1007/bf01580599.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Vehicle routing software"

1

Rincon, Garcia Nicolas. "Freight transport, routing software and time-dependent vehicle routing models." Thesis, University of Southampton, 2016. https://eprints.soton.ac.uk/397141/.

Full text
Abstract:
Routing and scheduling software is part of the Information and Technology systems available to support the transport industry, and uses complex algorithms along with geographical representations of the road network to allow better planning of daily collection and delivery schedules. This research reviews the evolution of routing and scheduling software, the algorithms used along with reported barriers to wider take-up and potential industry driven improvements that could be made. A survey of transport companies in the United Kingdom was conducted in order to validate and prioritize the software capabilities that require the most development according to the new challenges that the industry is facing. Responses suggested that companies required improved route optimization to tackle congestion based on time-dependent data and models, and greater accuracy in the representation of the road network. Not considering congestion leads to the underestimation of travel times and the production of inaccurate schedules. Literature shows that operational research techniques are available to solve problems that represent real world conditions, but research into the relative merits of using time-dependent models needs to be undertaken. Although exact methods have been developed to solve the Vehicle Routing Problem, they cannot cope with large instances and rich variants that are required by the industry. Therefore, metaheuristic algorithms are usually implemented in routing software. A reported barrier in metaheuristic algorithms is the lack of accuracy (the difference between optimal or best-known values and the result of the proposed algorithm). In this research an algorithm was developed using elements of Large Neighbourhood Search that is capable to substantially improve the state of the art for the time-dependent Vehicle Routing Problem. Comparison of results with available test instances shows that the proposed algorithm is capable of obtaining a reduction in the number of vehicles (4.15%), travel distance (10.88%) and travel time (12.00%) compared to previous implementations in reasonable time. A variant that considers the Rules on Drivers’ hours required in the scheduling of vehicles over 3.5 tons in the European Union and the UK is also introduced. Analysis of results show result improvements in number of vehicles (19.0%), travel distance (17.7%) and route duration (4.4%) compared to previous implementations.
APA, Harvard, Vancouver, ISO, and other styles
2

Sheasby, Janice. "Lagrangean heuristics for vehicle routing." Thesis, Coventry University, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.320251.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Castellani, Marta. "Gestione operativa della logistica distributiva mediante tecniche di clustering e vehicle routing: la piattaforma software LOG-OPTIMIZER." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2010. http://amslaurea.unibo.it/1008/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Gavigan, Kevin Charles. "The design, development and application of a combined connectionist expert system and 'Pocket' Boltzmann machine approach to the dynamic customer assignment and vehicle routing problem." Thesis, University of Warwick, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.245939.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Marcantoni, Giulio. "integrazione di una piattaforma software («ptv route optimizer») a supporto dell’attività di pianificazione dei viaggi del settore chiamato volante. il caso unilog group spa." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021.

Find full text
Abstract:
Il lavoro di questa tesi mira ad analizzare alcune delle problematiche derivanti dalla pianificazione dei viaggi e dalla gestione delle volumetrie della merce passante per i magazzini della Società Unilog Group S.p.A. la cui sede risiede ad Anzola dell’Emilia (BO). Il suo principale obiettivo è quello di introdurre il software di pianificazione PTV Route Optimizer per la creazione automatica dei viaggi per il ritiro e consegne della merce affidata dalla Grade Distribuzione Organizzata ad Unilog. Alla base di questo, si è quindi resa necessaria una approfondita analisi dei processi direttamente o indirettamente correlati a quello di pianificazione in modo da individuare fin da subito sia altre aree di miglioramento slegate all'introduzione del nuovo software sia per effettuare una migliore progettazione del nuovo processo di pianificazione stesso. A questo si è affiancata anche un'attività di analisi delle volumetrie delle merci trasportate dai mezzi della società in modo da poter incrementare la precisione di dati di input del software e quindi anche quella dei risultati stessi in termini di saturazione dei mezzi e numero di questi generati. Sono infine riportati i risultati dei test fatti una volta personalizzato il software alle esigenze dell'azienda e le considerazioni finali sulle criticità da superare per iniziare ad utilizzarlo in produzione
APA, Harvard, Vancouver, ISO, and other styles
6

Hartikka, Alice, and Simon Nordenhög. "Emission Calculation Model for Vehicle Routing Planning : Estimation of emissions from heavy transports and optimization with carbon dioxide equivalents for a route planning software." Thesis, Linköpings universitet, Energisystem, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-178065.

Full text
Abstract:
The transport sector is a major cause of emissions both in Sweden and globally. This master thesis aims to develop a model for estimating emissions from heavy transport on a specific route. The emissions can be used in a route planning software and help the driver choose a route that contributes to reduced emissions. The methodology was to investigate attributes, like vehicle-related attributes and topography, and their impact on transport emissions. The carbon dioxide, methane and nitrous oxide emissions were converted into carbon dioxide equivalents, which were incorporated as one cost together with a precalculated driving time as a second cost in a multi objective function used for route planning. Different tests were conducted to investigate the accuracy and the usability of the model. First, a validation test was performed, where the optimized routes were analyzed. The test showed that the model was more likely to choose a shorter route in general. The fuel consumption values largely met expectations towards generic values and measurements, that were gathered from research. A second test of the model made use of the driving time combined with the emissions in a multi objective function. In this test, a weighting coefficient was varied and analyzed to understand the possibility to find a value of the coefficient for the best trade-off. The result showed that the model generates different solutions for different coefficients and that it is possible to find a suitable trade-off between the driving time and emissions. Therefore, this study shows that there is a possibility to combine emission with other objectives such as driving time for route optimization. Finally, a sensitivity analysis was performed, where attribute factors and assumptions were varied to see how sensitive they were and, in turn, how much a change would impact the calculated emissions. The result from the sensitivity analysis showed that the changes in topography-attributes had less impact than changes on vehicle-related attributes. In conclusion, this thesis has built a foundation for route planning, based on the environmental aspect, for heavy transports.
APA, Harvard, Vancouver, ISO, and other styles
7

Lomba, Ana Cristina Galvão de Oliveira. "Estudo da implementação de um software de optimização de rotas numa empresa portuguesa de distribuição." Master's thesis, Instituto Superior de Economia e Gestão, 2013. http://hdl.handle.net/10400.5/11183.

Full text
Abstract:
Mestrado em Gestão e Estratégia Industrial
O objetivo deste trabalho é avaliar as melhorias do serviço de entregas de uma empresa de distribuição após a implementação de um software de planeamento e otimização de rotas. Nos dias de hoje, a capacidade de reduzir custos e manter a competitividade, tem ganho cada vez mais importância. Assim, a ELPOR, uma empresa de distribuição de material elétrico, decidiu melhorar o seu serviço de entregas e simultaneamente reduzir os custos associados ao transporte implementando um software de planeamento de rotas chamado TourSolver. A partir da comparação do número retornos na rota otimizada e na rota não-otimizada iremos concluir que as rotas otimizadas apresentam geralmente menos retornos que as rotas não otimizadas.
The purpose of this project is to evaluate the improvements in the delivery service of a distribution company after the implementation of a vehicle routing software. Nowadays, the capacity to reduce costs, and improve competitiveness is gaining more importance than ever. So, ELPOR, an electric material wholesaler, decided to improve their deliveries service and simultaneity reduce the transport costs by implementing a vehicle routing software named TourSolver. By comparing the number of returned packages in the optimized and non-optimized route, we will conclude that optimized routes generally have less returned packages than non-optimized routes.
APA, Harvard, Vancouver, ISO, and other styles
8

Uskay, Selim Onur. "Route Optimization For Solid Waste Transportation Using Parallel Hybrid Genetic Algorithms." Master's thesis, METU, 2010. http://etd.lib.metu.edu.tr/upload/12612942/index.pdf.

Full text
Abstract:
The transportation phase of solid waste management is highly critical as it may constitute approximately 60 to 75 percent of the total cost. Therefore, even a small amount of improvement in the collection operation can result in a significant saving in the overall cost. Despite the fact that there exist a considerable amount of studies on Vehicle Routing Problem (VRP), a vast majority of the existing studies are not integrated with GIS and hence they do not consider the path constraints of real road networks for waste collection such as one-way roads and U-Turns. This study involves the development of computer software that optimizes the waste collection routes for solid waste transportation considering the path constraints and road gradients. In this study, two different routing models are proposed. The aim of the first model is to minimize the total distance travelled whereas that of the second model is to minimize the total fuel consumption that depends on the loading conditions of the truck and the road gradient. A comparison is made between these two approaches. It is expected that the two approaches generate routes having different characteristics. The obtained results are satisfactory. The distance optimization model generates routes that are shorter in length whereas the fuel consumption optimization model generates routes that are slightly higher in length but provides waste collection on steeply inclined roads with lower truck load. The resultant routes are demonstrated on a 3D terrain view.
APA, Harvard, Vancouver, ISO, and other styles
9

Pelizaro, Cláudia. "Avaliação de desempenho do algoritmo de um programa comercial para roteirização de veículos." Universidade de São Paulo, 2000. http://www.teses.usp.br/teses/disponiveis/18/18137/tde-09102001-143129/.

Full text
Abstract:
Este trabalho teve como objetivo a avaliação de um software comercial de roteirização de veículos. Tal software, o Delivery, se propõe a ser uma ferramenta de apoio à decisão na escolha da rotina operacional de coleta e/ou distribuição física de produtos, através da criação de roteiros alternativos, o que possibilita analisar a viabilidade de implantação da rotina operacional. A proposta original consistia em desenvolver uma metodologia para testar e avaliar a qualidade das soluções geradas pelo algoritmo deste sistema. O trabalho foi conduzido através de uma pesquisa bibliográfica dos problemas clássicos de roteirização e programação de veículos, abordando suas classificações, estratégias e técnicas de solução. Um estudo em empresas que utilizam procedimentos sistemáticos de roteirização foi realizado, com a intenção de caracterizar o cenário em que se desenvolve a atividade de distribuição física. Neste estudo foi possível identificar as características mais relevantes para sistemas comerciais de roteirização de veículos, bem como caracterizar os software utilizados pelas empresas em questão. Finalmente, realizou-se uma análise empírica comparativa entre os software Delivery e TransCAD através da aplicação de problemas testes encontrados na literatura que representam algumas classes do problema de roteirização de veículos, além da aplicação de um caso real. Resultados demonstraram que a heurística do software TransCAD apresenta melhor desempenho que a do software Delivery.
The aim of this work is to evaluate a commercial computer program for vehicle routing. The software, named Delivery, has been designed to be a decision-support tool for planning goods collection and/or distribution. Its capacity for creating several alternative routes is very useful in the analysis of possible operational schemes before their actual implementation. A methodology for testing and evaluating the quality of the solution generated by the algorithm has been applied in this work, after a comprehensive literature review of the traditional vehicle routing and scheduling problems, their classification, and solution techniques and strategies. A field study in some companies that actually use a similar tool for routing their fleets has been carried out, in order to better understand how the activity is performed in real world conditions. The most important characteristics of commercial vehicle routing systems has been also identified in the field study, as well as the software used by the studied companies. Finally, a comparative empirical analysis with the software Delivery and TransCAD has been carried out. In order to compare them, test problems available in the literature, that correspond to some of the most common vehicle routing problems, and a real case application were employed. The results have shown that the heuristic of TransCAD had a better performance than the one used in Delivery.
APA, Harvard, Vancouver, ISO, and other styles
10

Santos, Cely Martins dos. "A viabilização de softwares comerciais na roteirização de veículos de serviços de entregas, visando a geração de respostas rápidas e eficientes." Universidade de São Paulo, 1999. http://www.teses.usp.br/teses/disponiveis/18/18137/tde-26012018-183754/.

Full text
Abstract:
Este trabalho foi motivado pela necessidade de otimização nos serviços de entregas urbanas combinados com o alto custo de implantação e customização da maioria dos pacotes disponíveis comercialmente, que muitas empresas se defrontam, na expectativa de obtenção de respostas rápidas e eficientes, numa base diária. Geralmente a utilização destes software requerem grandes investimentos de tempo e recursos. Os custos operacionais do transporte de cargas têm experimentado um aumento expressivo devido a fatores que, de uma forma ou de outra, impedem o fluxo eficiente dos veículos na rede, tomando evidente a necessidade de ferramentas flexíveis e efetivas. Vários estudos encontrados na literatura revelaram que fatores como restrições de circulação e velocidades nos arcos têm contribuído para aumentar distâncias de percursos e a frota de veículos. Geralmente, estas rotas são planejadas de forma simplificada, utilizando um fator de correção, que fornece uma solução aproximada. Um SIG foi objeto de estudo na operação de entregas urbanas, de forma a atingir os objetivos deste trabalho. O estudo de caso abordou os serviços de entregas de bebidas na cidade de São Carlos, onde foi aplicada a heurística de economias de Clarke & Wright implementadas no software TransCAD 3.2. Foram feitas diversas simulações, comparando os resultados das distâncias em rede com os valores das distâncias estimadas, como também com as distâncias percorridas pela empresa distribuidora.
This research was motivated by the necessity of optimization of urban delivery services and the high cost of implementation and customization of most routing packages commercially available. Moreover, the companies expect to obtain fast and efficient answers on a daily base. The use of some routing software generally requires significant investments of time and other resources. The operational costs of freight transport have had a remarkable increase due to factors which somehow restraint the efficient flow of the vehicles in a network, leading to the need of flexible and effective tools. Several studies in the literature have revealed that factors such as restrictions of circulation and speed on network contribute to increase the travel distances and the fleet size. Generally, these routes are planned in a simplified way, using a correction factor to get an approximated solution. This research has considered the use of Geographical Information Systems as a tool to achieve better results for routing delivery services. The case study was the delivery service of beverages in the city of São Carlos. The Clarke & Wright\'s heuristic of economies was irnplemented in the TransCAD 3.2 software. Several simulations were carried out, comparing the results of route length, considering network and estimated distances, as well as the real one traveled by the delivery company\'s vehicles.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Vehicle routing software"

1

Canada. Natural Resources Canada. The Conseil des écoles catholiques de langue française de la région d'Ottawa-Carleton: Bus routing software provides quick payback-major savings for French School Board. Ottawa: Natural Resources Canada, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bioinspired Algorithms For The Vehicle Routing Problem. Springer, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Tavares, Jorge, and Francisco Baptista Pereira. Bio-inspired Algorithms for the Vehicle Routing Problem. Springer, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Vehicle routing software"

1

Bräysy, Olli, and Geir Hasle. "Chapter 12: Software Tools and Emerging Technologies for Vehicle Routing and Intermodal Transportation." In Vehicle Routing, 351–80. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2014. http://dx.doi.org/10.1137/1.9781611973594.ch12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Dillmann, Roland. "Strategic Vehicle Routing in Practice — A pure Software Problem or a Problem Requiring Scientific Advice? Routing Problems of Daily Deliveries to the Same Customers." In Lecture Notes in Economics and Mathematical Systems, 287–305. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/978-3-642-56183-2_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Baker, Edward K. "14. Evolution of Microcomputer-Based Vehicle Routing Software: Case Studies in the United States." In The Vehicle Routing Problem, 353–61. Society for Industrial and Applied Mathematics, 2002. http://dx.doi.org/10.1137/1.9780898718515.ch14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Xiao, Yiyong, and Abdullah Konak. "Green Vehicle Routing Problem with Time-Varying Tra ffic Congestion." In Operations Research and Computing: Algorithms and Software for Analytics, 134–48. INFORMS, 2015. http://dx.doi.org/10.1287/ics.2015.0010.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Lum, Oliver, Ping Chen, Xingyin Wang, Bruce Golden, and Edward Wasil. "A Heuristic Approach for the Swap-Body Vehicle Routing Problem." In Operations Research and Computing: Algorithms and Software for Analytics, 172–87. INFORMS, 2015. http://dx.doi.org/10.1287/ics.2015.0013.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Büyüksaatçı Kiriş, Sinem, and Tuncay Özcan. "Metaheuristics Approaches to Solve the Employee Bus Routing Problem With Clustering-Based Bus Stop Selection." In Artificial Intelligence and Machine Learning Applications in Civil, Mechanical, and Industrial Engineering, 217–39. IGI Global, 2020. http://dx.doi.org/10.4018/978-1-7998-0301-0.ch012.

Full text
Abstract:
Vehicle routing problem (VRP) is a complex problem in the Operations Research topic. School bus routing (SBR) is one of the application areas of VRP. It is also possible to examine the employee bus routing problem in the direction of SBR problem. This chapter presents a case study with data taken from a retail company for capacitated employee bus routing problem. A mathematical model was developed based on minimizing the total bus route distance. The number and location of bus stops were determined using k-means and fuzzy c-means clustering algorithms. LINGO optimization software was utilized to solve the mathematical model. Then, due to NP-Hard nature of the bus routing problem, simulated annealing (SA) and genetic algorithm (GA)-based approaches were proposed to solve the real-world problem. Finally, the performances of the proposed approaches were evaluated by comparing with classical heuristics such as saving algorithm and nearest neighbor algorithm. The numerical results showed that the proposed GA-based approach with k-means performed better than other approaches.
APA, Harvard, Vancouver, ISO, and other styles
7

Hirsch, Patrick. "Minimizing Empty Truck Loads in Round Timber Transport with Tabu Search Strategies." In Management Innovations for Intelligent Supply Chains, 97–122. IGI Global, 2013. http://dx.doi.org/10.4018/978-1-4666-2461-0.ch006.

Full text
Abstract:
In Central Europe transportation accounts for an estimated 30% of the total costs of round timber and is an essential element of cost. In this paper, Tabu Search based methods for solving the Timber Transport Vehicle Routing Problem (TTVRP) are presented. The TTVRP uses solutions of preceding optimization problems as input that are obtained with standard solver software. The presented methods differ with respect to the considered neighborhood and the static or dynamic setting of their parameters. They are verified with real life data in extensive numerical studies and compared to the results obtained with the solver software Xpress. It is shown that the methods are capable to generate good solutions in reasonable computing time.
APA, Harvard, Vancouver, ISO, and other styles
8

Nair, Rajit, and Amit Bhagat. "An Application of Big Data Analytics in Road Transportation." In Advances in Systems Analysis, Software Engineering, and High Performance Computing, 39–54. IGI Global, 2018. http://dx.doi.org/10.4018/978-1-5225-3870-7.ch003.

Full text
Abstract:
Data is being captured in all domains of society and one of the important aspects is transportation. Large amounts of data have been collected, which are detailed, fine-grained, and of greater coverage and help us to allow traffic and transportation to be tracked to an extent that was not possible in the past. Existing big data analytics for transportation is already yielding useful applications in the areas of traffic routing, congestion management, and scheduling. This is just the origin of the applications of big data that will ultimately make the transportation network able to be managed properly and in an efficient way. It has been observed that so many individuals are not following the traffic rules properly, especially where there are high populations, so to monitor theses types of traffic violators, this chapter proposes a work that is mainly based on big data analytics. In this chapter, the authors trace the vehicle and the data that has been collected by different devices and analyze it using some of the big data analysis methods.
APA, Harvard, Vancouver, ISO, and other styles
9

Bonilla-Enriquez, Gladys, and Santiago-Omar Caballero-Morales. "Search Algorithms on Logistic and Manufacturing Problems." In Search Algorithm - Essence of Optimization [Working Title]. IntechOpen, 2021. http://dx.doi.org/10.5772/intechopen.96554.

Full text
Abstract:
The supply chain comprehensively considers problems with different levels of complexity. Nowadays, design of distribution networks and production scheduling are some of the most complex problems in logistics. It is widely known that large problems cannot be solved through exact methods. Also, specific optimization software is frequently needed. To overcome this situation, the development and application of search algorithms have been proposed to obtain approximate solutions to large problems within reasonable time. In this context, the present chapter describes the development of Genetic Algorithms (an evolutionary search algorithm) for vehicle routing, product selection, and production scheduling problems within the supply chain. These algorithms were evaluated by using well-known test instances. The advances of this work provide the general discussions associated to designing these search algorithms for logistics problems.
APA, Harvard, Vancouver, ISO, and other styles
10

Roy, Siuli, Anurag D, and Somprakash Bandyopadhyay. "Testbed Implementation of a Pollution Monitoring System Using Wireless Sensor Network for the Protection of Public Spaces." In Networking and Telecommunications, 820–33. IGI Global, 2010. http://dx.doi.org/10.4018/978-1-60566-986-1.ch053.

Full text
Abstract:
Air pollution is an important environmental issue that has a direct effect on human health and ecological balance. Factories, power plants, vehicles, windblown dust and wildfires are some of the contributors of to pollution. Reasonable simulation tools exist for evaluating large scale sensor networks, ; however, they fail to capture significant details of node operation or practical aspects of wireless communication. Real life testbeds, capture the realism and bring out important aspects for further research. In this paper, we present an implementation of a wireless sensor network testbed for automatic and real-time monitoring of environmental pollution for the protection of public spaces. The paper describes the physical setup, the sensor node hardware and software architecture for “anytime, anywhere” monitoring and management of pollution data through a single, Web-based graphical user interface. The paper presents practical issues in the integration of sensors, actual power consumption rates and develops a practical hierarchical routing methodology.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Vehicle routing software"

1

Cai, Wenxue, Zefeng Wu, Xiaoyu Huang, and Huiling Zhong. "An EBM Based Dynamic Vehicle Routing Algorithm." In 2009 International Conference on Computational Intelligence and Software Engineering. IEEE, 2009. http://dx.doi.org/10.1109/cise.2009.5366329.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Li, Ya, Dong Wang, Yuewu Yang, Yan Zhou, and Chen Wu. "Parallel Ant Colony Optimization Algorithm for Vehicle Routing Problem." In 2013 International Conference on Software Engineering and Computer Science. Paris, France: Atlantis Press, 2013. http://dx.doi.org/10.2991/icsecs-13.2013.22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Yang, Shixin, Jing Liu, and Xiongshi Yan. "Flexible Routing-Proactive Updating Mechanism for Software Defined Vehicle Networks." In 2018 10th International Conference on Wireless Communications and Signal Processing (WCSP). IEEE, 2018. http://dx.doi.org/10.1109/wcsp.2018.8555633.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Sassi, Jamila, Ines Alaya, and Moncef Tagina. "Bee-route: A Bee Algorithm for the Multi-objective Vehicle Routing Problem." In 15th International Conference on Software Technologies. SCITEPRESS - Science and Technology Publications, 2020. http://dx.doi.org/10.5220/0009831303070318.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Saad, Sameh M., and Ramin Bahadori. "Pollution routing problem with time window and split delivery." In The 7th International Workshop on Simulation for Energy, Sustainable Development & Environment. CAL-TEK srl, 2019. http://dx.doi.org/10.46354/i3m.2019.sesde.004.

Full text
Abstract:
In most classic vehicle routing problems, the main goal is to minimise the total travel time or distance while, the green vehicle routing problem, in addition to the stated objectives, also focuses on minimising fuel costs and greenhouse gas emissions, including carbon dioxide emissions. In this research, a new approach in Pollution Routing Problem (PRP) is proposed to minimise the CO2 emission by investigating vehicle weight fill level in length of each route. The PRP with a homogeneous fleet of vehicles, time windows, considering the possibility of split delivery and constraint of minimum shipment weight that must be on the vehicle in each route is investigated simultaneously. The mathematical model is developed and implemented using a simulated annealing algorithm which is programmed in MATLAB software. The generated results from all experiments demonstrated that the application of the proposed mathematical model led to the reduction in CO2 emission.
APA, Harvard, Vancouver, ISO, and other styles
6

Cai, Zengyu, Yuan Feng, Yong Gan, Baowei Zhang, and Shuru Liu. "Research on logistics vehicle routing problem based on genetic algorithm." In 2011 IEEE 3rd International Conference on Communication Software and Networks (ICCSN). IEEE, 2011. http://dx.doi.org/10.1109/iccsn.2011.6014712.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Jun-Qi Chen, Wan-Ling Li, and Tomohiro Murata. "Particle swarm optimization for vehicle routing problem with uncertain demand." In 2013 IEEE 4th International Conference on Software Engineering and Service Science (ICSESS). IEEE, 2013. http://dx.doi.org/10.1109/icsess.2013.6615440.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Meng Wei and Yu Bin. "Research on optimization of vehicle routing based on Hopfield neural network." In 2011 IEEE 2nd International Conference on Software Engineering and Service Science (ICSESS). IEEE, 2011. http://dx.doi.org/10.1109/icsess.2011.5982278.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Dong, Baihong, Weigang Wu, Zhiwei Yang, and Junjie Li. "Software Defined Networking Based On-Demand Routing Protocol in Vehicle Ad Hoc Networks." In 2016 12th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN). IEEE, 2016. http://dx.doi.org/10.1109/msn.2016.041.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Luciano Roesler Rese, Alex, Fabricio Bortoluzzi, Victor Hugo Fagundes Wachsmann, and Rafael Ballottin Martins. "W/B Planner -Solucionador para Roteamento de Veículos no Transporte Fretado de Passageiros." In Computer on the Beach. São José: Universidade do Vale do Itajaí, 2021. http://dx.doi.org/10.14210/cotb.v12.p459-466.

Full text
Abstract:
Companies of chartered transport of passengers need to manage routes with boarding points, based on the location of the passengers. As the number of routes grow, the task of manually manage and optimize routings becomes inviable. The vehicle routing problem characterizes inside this scenario, branching into specific problems, that need different solutions for each case. Meta-heuristics are usually used to build solver algorithms for these problems. Constraint programming was chosen for helping build the solver. The main objective of the work was, to develop a system performing the solution of routings in an automatized way, by utilization of constraint programming and meta-heuristic algorithms. To minimize transport costs, travel time, and maximize the use of vehicles in an efficient and planned manner. The tests were carried out in conjunction with a routing administrator, to validate the use of the application within the research field. From the evaluations made, they demonstrated the utility of the software within its purpose. Of which it was observed that the product of this research, helped in the construction of an automated fleet consulting tool, being able to dynamically point out the distribution and operationality of a fleet of chartered vehicles in the transportation of passengers.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Vehicle routing software' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography