Showing 1 - 10 of 1,187
Persistent link: https://www.econbiz.de/10000787997
Persistent link: https://www.econbiz.de/10001576002
Persistent link: https://www.econbiz.de/10001662723
Persistent link: https://www.econbiz.de/10002599620
This paper proposes a new On-Demand Ant-based Multiagent Routing Algorithm (ODAMRA) for Mobile Ad hoc Networks (MANETs), which combines the on-demand routing capability of Ad hoc On-demand Distance Vector (AODV) routing protocol with some modifications in the existing ant colony optimization...
Persistent link: https://www.econbiz.de/10014185953
We consider a multi-cluster vehicle routing problem with pickups and deliveries. A cluster consists of a set of nodes with requests for shipment. A single depot serves all requests in each cluster by means of capacitated trucks which pick up a consignment and deliver the same at nodes with...
Persistent link: https://www.econbiz.de/10014201288
We have developed a non-linear multi-objective model for optimal design of railway timetables. The objectives of the model are to maximize schedule reliability and minimize energy consumption, rolling stock and crew deployment. Metrics have been derived for each of these objectives. AHP is used...
Persistent link: https://www.econbiz.de/10014153838
The traveling salesman problem is a problem in graph theory requiring the most efficient (i.e., least total distance) Hamiltonian cycle a salesman can take through each of n cities. No general method of solution is known, and the problem is NP-hard
Persistent link: https://www.econbiz.de/10014122915
The cities face the challenge of optimizing investments into waste management to meet the EU standards while maintaining economic affordability. One of the issues is the optimal location for specialized waste collection points. The main target is to find the lowest number of collection points...
Persistent link: https://www.econbiz.de/10014082377
We consider the coordinated vehicle platooning problem over a road network with time constraints and the routes of vehicles are given. The problem is to coordinate the departure time of each vehicle to enable platoon formation hence maximizing the total fuel saving. We first focus on the case...
Persistent link: https://www.econbiz.de/10014083630