Results 51 to 60 of about 125,175 (192)
Algorithms for Capacitated Vehicle Routing [PDF]
SIAM Journal on Computing, 1998 Summary: Given \(n\) identical objects (pegs), placed at arbitrary initial locations, we consider the problem of transporting them efficiently to \(n\) target locations (slots) with a vehicle that can carry at most \(k\) pegs at a time. This problem is referred to as \(k\)-delivery TSP, and it is a generalization of the traveling salesman problem.
Charikar, Moses +2 more
openaire +1 more source
Vehicle routing and scheduling of demand-responsive connector with on-demand stations
Advances in Mechanical Engineering, 2017 As an important supplement of conventional fixed-route public transit, flexible transit services draw more attention in low-demand areas recently. Demand-responsive connector is one of those flexible transit services and has already been operated as ...
Jinxing Shen +3 more
doaj +1 more source
Alexandria Engineering Journal, 2018 The vehicle routing problem is the basic problem of distribution planning which seeks to find the best route with minimum displacement cost considering the number of customers, their constraints, and number and capacity of the available vehicles. In this
Davoud Sedighizadeh, Houman Mazaheripour
doaj +1 more source
Tackling Dynamic Vehicle Routing Problem with Time Windows by means of Ant Colony System
, 2017 The Dynamic Vehicle Routing Problem with Time Windows (DVRPTW) is an extension of the well-known Vehicle Routing Problem (VRP), which takes into account the dynamic nature of the problem.
Breaban, Mihaela +2 more
core +1 more source
Experimental Characterization of Routing Protocols in Urban Vehicular Communication
Transport and Telecommunication, 2019 Vehicular communication is a cynosure in automotive industry these days. V2V communication is one of the types of vehicular communication which render lane change warning, emergency vehicle alert, intersection alert, congestion alert, payment at tolls ...
Punia Divya, Kumar Rajender
doaj +1 more source
A Computational Study of Genetic Crossover Operators for Multi-Objective Vehicle Routing Problem with Soft Time Windows [PDF]
, 2008 The article describes an investigation of the effectiveness of genetic algorithms for multi-objective combinatorial optimization (MOCO) by presenting an application for the vehicle routing problem with soft time windows.
Geiger, Martin Josef
core +1 more source
Jurnal Optimasi Sistem Industri, 2020 One-door container type of vehicle is the main tool for urban logistics in Indonesia which may take the form of truck, car, or motorcycle container. The operations would be more effective when it is performed through pickup-delivery or forward-reverse ...
Paulina Kus Ariningsih +3 more
doaj +1 more source
Enhancing heuristic bubble algorithm with simulated annealing
Cogent Business & Management, 2016 In this study, a new way to improve the Heuristic Bubble Algorithm (HBA) is presented. HBA is a nature-inspired algorithm, which is a new approach to and initially implemented for, vehicle routing problems of pickup and delivery (VRPPD).
Mehmet Fatih Yuce +2 more
doaj +1 more source
A Genetic Algorithm on Inventory Routing Problem
Emerging Markets Journal, 2014 Inventory routing problem can be defined as forming the routes to serve to the retailers from the manufacturer, deciding on the quantity of the shipment to the retailers and deciding on the timing of the replenishments.
Nevin Aydın
doaj +1 more source
Cogent Engineering, 2020 This article aims to present research conducted on the literature regarding multi-objective optimization for routing problems with environmental considerations, referred to here as Multi-objective Optimization for the Green Vehicle Routing Problem ...
Júlio César Ferreira +2 more
doaj +1 more source