Titlebook: Computational Logistics; 8th International Co Tolga Bektaş,Stefano Coniglio,Stefan Voß Conference proceedings 2017 Springer International P

有恶意

R. J. Pollitt,R. A. Harkness,G. M. Addisonbased on the . approach. It incorporates a . procedure that converts a . into an optimal solution. Experiments conducted on benchmark instances show that our algorithm outperforms the existing methods in the literature. Actually, we have found the best known solution for 916 instances from 924 with strict improvement of 82 instances.

EVICT

Archana R. Dholakia,Ravindra H. Dholakiademand satisfied at the critical nodes. We present an optimal splitting procedure and a metaheuristic framework that can execute four different methods, by changing only three parameters. The results shows the good performance of two methods and highlight the efficiency of the splitting procedure.

偏见

构想

Studies in Labor Market Dynamicse methodological relevance of Fuzzy Logic at a strategic, tactical and operational level for maritime operations. In addition, a general classification of decision problems in maritime logistics is presented, extending previous classifications in the literature to the wider context of multiple port networks.

占线

An Effective Large Neighborhood Search for the Team Orienteering Problem with Time Windowsorhood Search and can outperform the performance of algorithms available in the literature. We provide computational experiments for well known benchmark instances and are able to compute new best solutions for 17 of these instances. On average, the gap between our results and best known solutions s

地壳

Hybrid Heuristic for the Clustered Orienteering Problemsets called .. A profit is assigned to each cluster and is collected only if all customers belonging to the cluster are served. The objective is to visit the customers of a subset of clusters in order to maximize the total collected profit with respect to a travel time limit. Our solution method is

archetype

木讷

思考才皱眉

Maximizing the Number of Served Requests in an Online Shared Transport System by Solving a Dynamic DDARP is to design vehicle routes satisfying requests of users and minimizing the total traveled distance. In this work, we consider a real case of dynamic DARP service operated by . (.) in Paris and Bristol. . offers a high quality transportation service in which users ask for a service either in re

Inkling

A Polyhedral Study of the Elementary Shortest Path Problem with Resource Constraintsution approaches for the well-known vehicle routing problem with time windows (VRPTW). ESPPRC is .-hard in the strong sense [.]. Most previous approaches alternatively address a relaxed version of the problem where the path does not have to be elementary, and pseudo-polynomial time algorithms based