scholarly journals Location flexibility in parcel delivery operations: framework and empirical analysis

Author(s):  
Dmitry Krushinsky ◽  
Xuezhen Guo ◽  
G D H Claassen

Abstract In traditional parcel delivery operations, customers determine delivery locations and, hence, the performance of a transporter. We exploit this idea and show that customers can improve the efficiency of a transporter by giving the latter flexibility in choosing the delivery locations. Two possible policies to enable this flexibility are presented and evaluated. The first policy, conceptually similar to roaming vehicle routing, is related to the presence of alternative locations. The second policy is related to the possibility of aggregating/skipping some locations. We show that route optimization behind both policies can be modelled via the well-known generalized travelling salesman problem. Extensive computational experiments with real parcel delivery data are performed to evaluate the potential of the presented policies and to obtain insights for possible implementation in daily practice. The experiments show that under certain conditions, the two proposed policies can lead to 15 to 20% improvement in the route length and in extreme yet realistic cases up to 40 to 50%. Consequently, the concept of flexible delivery locations has potential for practice, especially in densely populated areas.

2021 ◽  
Vol 13 (10) ◽  
pp. 5492
Author(s):  
Cristina Maria Păcurar ◽  
Ruxandra-Gabriela Albu ◽  
Victor Dan Păcurar

The paper presents an innovative method for tourist route planning inside a destination. The necessity of reorganizing the tourist routes within a destination comes as an immediate response to the Covid-19 crisis. The implementation of the method inside tourist destinations can bring an important advantage in transforming a destination into a safer one in times of Covid-19 and post-Covid-19. The existing trend of shortening the tourist stay length has been accelerated while the epidemic became a pandemic. Moreover, the wariness for future pandemics has brought into spotlight the issue of overcrowded attractions inside a destination at certain moments. The method presented in this paper proposes a backtracking algorithm, more precisely an adaptation of the travelling salesman problem. The method presented is aimed to facilitate the navigation inside a destination and to revive certain less-visited sightseeing spots inside a destination while facilitating conformation with the social distancing measures imposed for Covid-19 control.


Author(s):  
L. Díaz-Vilariño ◽  
E. Frías ◽  
J. Balado ◽  
H. González-Jorge

<p><strong>Abstract.</strong> Scan-to-BIM systems have been recently proposed for the dimensional and quality assessment of as-built construction components with planned works. The procedure is generally based on the geometric alignment and comparison of as-built laser scans with as-designed BIM models. A major concern in Scan-to-BIM procedures is point cloud quality in terms of data completeness and consequently, the scanning process should be designed in order to obtain a full coverage of the scene while avoiding major occlusions. This work proposes a method to optimize the number and scan positions for Scan-to-BIM procedures following stop &amp;amp; go scanning. The method is based on a visibility analysis using a <i>ray-tracing algorithm</i>. In addition, the optimal route between scan positions is formulated as a <i>travelling salesman problem</i> and solved using a suboptimal <i>ant colony optimization algorithm</i>. The distribution of candidate positions follows a grid-based structure, although other distributions based on triangulation or tessellation can be implemented to reduce the number of candidate positions and processing time.</p>


Author(s):  
Saúl Gonzalez-Bermejo ◽  
Guillermo Alonso-Linaje ◽  
Parfait Atchade-Adelomou

We propose a new binary formulation of the Travelling Salesman Problem (TSP), with which we overcame the best formulation of the Vehicle Routing Problem (VRP) in terms of the minimum number of necessary variables. Furthermore, we present a detailed study of the constraints used and compare our model (GPS) with other frequent formulations (MTZ and native formulation). Finally, we have carried out a coherence and efficiency check of the proposed formulation by running it on a quantum annealing computer, D-Wave\_2000Q6.


Author(s):  
Cristina Maria Păcurar ◽  
Ruxandra Gabriela Albu ◽  
Victor Dan Păcurar

The paper presents an innovative method for tourist route planning inside a destination. The necessity of reorganizing the tourist routes within a destination comes as an immediate response to the Covid-19 crisis. The implementation of the method inside tourist destinations can be an important advantage in transforming a destination into a safer destination in times of Covid-19 and post-Covid-19. The existing trend of shortening the tourist stay length has been accelerated while the epidemic became a pandemic. Moreover, the wariness for future pandemics has brought to the spotlight the issue of overcrowded attractions inside a destination at certain moments. The method proposed in this paper proposes a backtracking algorithm, more precisely an adaptation of the travelling salesman problem. The method presented aims to facilitate the navigation inside a destination and to revive certain less-visited sightseeing spots inside a destination while facilitating the social distancing measures imposed by Covid-19.


Sign in / Sign up

Export Citation Format

Share Document