Conference Paper

Delivery Improvement for Transport Companies

Univ. of Seville, Seville
DOI: 10.1109/ICCBSS.2008.23 Conference: Composition-Based Software Systems, 2008. ICCBSS 2008. Seventh International Conference on
Source: DBLP


In this paper we propose a solution that improves the synchronization and effectiveness of sending and receiving of goods and merchandise by transport companies. We use a service-oriented architecture for the exchange of information related to the reception of products, such as the predicted time when the delivery should take place or the delay in the arrival. Our solution is based on fleet management systems widely used in the transport companies. The main objective of this paper is to improve the interoperability between providers and consumers, thereby creating a communication environment versed in delivery plans. Another feature revised here is the analysis of vehicle tracking information to obtain accurate knowledge of the movement pattern followed by drivers and usefulness for the companies.

Download full-text


Available from: Alejandro Fernández-Montes, Jul 14, 2015
18 Reads
  • [Show abstract] [Hide abstract]
    ABSTRACT: Vehicle routing problem with time windows (VRPTW) is of crucial importance in today's industries, accounting for a significant portion of many distribution and transportation systems. In this paper, we present a computational-efficient VRPTW algorithm, which is based on the principles of particle swarm optimization (PSO). PSO follows a collaborative population-based search, which models over the social behavior of bird flocking and fish schooling. PSO system combines local search methods (through self experience) with global search methods (through neighboring experience), attempting to balance exploration and exploitation. We discuss the adaptation and implementation of the PSO search strategy to VRPTW and provide a numerical experiment to show the effectiveness of the heuristic. Experimental results indicate that the new PSO algorithm can effectively and quickly get optimal resolution of VRPTW.
    Evolutionary Computation, 2006. CEC 2006. IEEE Congress on; 01/2006
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we consider a local logistic company that provides transportation service for moving empty and laden containers within Singapore. Due to the limited capacity of its own fleet of vehicles, the company cannot handle all the job orders and have to outsource some orders to other smaller local transportation companies. The current operation of assigning jobs for outsourcing goes through two steps. In the first step, a certain percentage of jobs will be preselected for outsourcing according to some simple rules. Then at the second step, the rest of the jobs will be put into an in-house computer system which assigns jobs to its internal fleet of vehicles according to some greedy rules and the remaining jobs that cannot be served by the internal fleet of vehicles will be outsourced. This paper presents a vehicle capacity planning system (VCPS), which models the problem as a vehicle routing problem with time window constraints (VRPTW) and tabu search (TS) is applied to find a solution for the problem. From the simulation results, some new rules on how to assign jobs for outsourcing are derived, which are shown to be about 8% better than existing rules currently adopted by the company.
    IEEE Transactions on Systems Man and Cybernetics - Part A Systems and Humans 04/2003; 33(2-33):169 - 178. DOI:10.1109/TSMCA.2002.806498 · 2.18 Impact Factor