|
|
|
Maria Caria, Giuseppe Todde and Antonio Pazzona
The milk transformation process, in the last thirty years, moved from on-farm to centralised cheese factories, affecting the management of transport logistics. In Sardinia, the presence of about 12,000 dairy sheep farms, located in rural areas with poor ...
ver más
|
|
|
|
|
|
|
Liqun Liu, Jiuyuan Huo, Fei Xue and Yongqiang Dai
This paper proposes an improved Harmony Search algorithm, and gives the definition of the Global Sharing Factor of the Harmony Search (HS) algorithm. In the definition, the number of creations of the HS algorithm is applied to the sharing factor and calc...
ver más
|
|
|
|
|
|
|
Mohamed Guedria, Nicolas Malhene, Jean-Christophe Deschamps
Pág. 413 - 424
This paper considers two well-known strategies for the organization of tours for urban deliveries: the vehicle routing problem (VRP) and the optimization of vehicle loading plan problem. Experience shows that optimal solutions are rarely implemented give...
ver más
|
|
|
|
|
|
|
Inês A. Ferreira, Catarina Bento, Luís Mascarenhas, Carina Pimentel and Helena Carvalho
The number of variants of the vehicle routing problem (VRP) has grown rapidly in the last decades. Among these, VRPs with time window constraints are among the most studied ones. However, the literature regarding VRPs that concerns the delivery and insta...
ver más
|
|
|
|
|
|
|
Fakhar Uddin, Naveed Riaz, Abdul Manan, Imran Mahmood, Oh-Young Song, Arif Jamal Malik and Aaqif Afzaal Abbasi
The travelling salesman problem (TSP) is perhaps the most researched problem in the field of Computer Science and Operations. It is a known NP-hard problem and has significant practical applications in a variety of areas, such as logistics, planning, and...
ver más
|
|
|
|
|
|
|
Domagoj Jakobovic, Marko Ðurasevic, Karla Brkic, Juraj Fosin, Tonci Caric and Davor Davidovic
Many real-world applications of the vehicle routing problem (VRP) are arising today, which range from physical resource planning to virtual resource management in the cloud computing domain. A common trait of these applications is usually the large scale...
ver más
|
|
|
|
|
|
|
Antonino Vitetta
Given two pick-up and delivery points, the best path chosen does not necessarily follow the criteria of minimum travel time or generalized minimum cost evaluated with a deterministic approach. Given a criterion, the perceived cost is not deterministic fo...
ver más
|
|
|
|
|
|
|
Sana Sahar Guia, Abdelkader Laouid, Mohammad Hammoudeh, Ahcène Bounceur, Mai Alfawair and Amna Eleyan
Complex systems are often designed in a decentralized and open way so that they can operate on heterogeneous entities that communicate with each other. Numerous studies consider the process of components simulation in a complex system as a proven approac...
ver más
|
|
|
|
|
|
|
Jane Lin, Wei Zhou, Ouri Wolfson
Pág. 508 - 521
This paper presents a general Electric Vehicle Routing Problem (EVRP) that finds the optimal routing strategy with minimal travel time cost and energy cost as well as number of EVs dispatched. This is the first EVRP model to consider the vehicle load eff...
ver más
|
|
|
|
|
|
|
Keyju Lee and Junjae Chae
The vehicle routing problem (VRP) attempts to find optimal (minimum length) routes for a set of vehicles visiting a set of locations. Solving a VRP calls for a cost matrix between locations. The size of the matrix grows quadratically with an increasing n...
ver más
|
|
|
|