A Decision Support Approach for Postal Delivery and Waste Collection Services

Abstract

This paper presents an urban-decision support system (U-DSS) devoted to manage, in a unified framework, the logistic services of the smart cities, such as postal delivery (PD) and waste collection (WC) services. The U-DSS architecture is proposed by describing its main components. In particular, this paper focuses on the core of the U-DSS, i.e., the model component that provides the solutions of a general vehicle assignment and routing optimization problem with the aim of minimizing the length of the routes and satisfying time and capacity constraints. In order to solve the vehicle routing problems in reasonable time, a two-phase heuristic algorithm is proposed based on a clustering strategy and a farthest insertion heuristic for the solution of a traveling salesman problem. The applicability of the proposed U-DSS is enlightened by comparing the proposed heuristic algorithm solutions with the mixed integer linear programming problem solutions of the PD and WC services. Moreover, the discussion of the real case studies of the city of Bari (Italy) assesses the proposed approach

A Novel Application Based on a Heuristic Approach for Planning Itineraries of One-Day Tourist

“…In this case, it is necessary to implement a multi-level algorithm to be able to consult the tourist on any relocation of PoIs in the tour. To these aims, we applied the Travel Salesman Problem (TSP) [39][40][41] method that involves finding the shortest route through n nodes that begins and ends at the same city and visits every node. The TSP is among the best-known combinatorial optimization problems and has been intensely studied by researchers in various research fields.…”

Postboxes Quantitative Optimization Model

“…Mitrović-Minić et al [8] present a discussion regarding algorithms for the integrated management of mail collection and distribution activities. Abbatecola et al provided a detailed description of a decision support system for postal delivery management in urban areas based on vehicle routing models [9]. Ulmer et al used methods of approximate dynamic programming to offer solutions for dynamic vehicle routing with stochastic customer requests [10].…”

“…- (7)(8)(9)(10)(11)(12)(13)(14) This construction of the problem leads us to the conclusion that the total distance that all users will have to travel equals 395,009.14 km.…”

“…- (7)(8)(9)(10)(11)(12)(13)(14) The result obtained after this step of the lexicographic method shows that 74,250 users will use postboxes in new locations, i.e., they will have to change their existing habits related to sending letters via postboxes.…”

“…-min F 3 -s.t.- (7)(8)(9)(10)(11)(12)(13)(14) Finally, the objective function F3, which represents the total distance between all of the remaining active postboxes, is 9668.3 km. Based on the obtained solutions, the layout of the postboxes that should remain in use is shown in Figure 4.…”