14 research outputs found

    A reduced integer programming model for the ferry scheduling problem

    Get PDF
    We present an integer programming model for the ferry scheduling problem, improving existing models in various ways. In particular, our model has reduced size in terms of the number of variables and constraints compared to existing models by a factor of approximately O(n), where n being the number of ports. The model also handles efficiently load/unload time constraints, crew scheduling and passenger transfers. Experiments using real world data produced high quality solutions in 12 hours using CPLEX 12.4 with a performance guarantee of within 15% of optimality, on average. This establishes that using a general purpose integer programming solver is a viable alternative in solving the ferry scheduling problem of moderate size.Comment: To appear in Public Transpor

    Optimizing for Transfers in a Multi-Vehicle Collection and Delivery Problem

    No full text
    Abstract We address the Collection and Delivery Problem (CDP) with multiple vehicles, such that each collects a set of items at different locations and delivers them to a dropoff point. The goal is to minimize either delivery time or the total distance traveled. We introduce an extension to the CDP: what if a vehicle can transfer items to another vehicle before making the final delivery? By dividing the labor among multiple vehicles, the delivery time and cost may be reduced. However, introducing transfers increases the number of feasible schedules exponentially. In this paper, we investigate this Collection and Delivery Problem with Transfers (CDP-T), discuss its theoretical underpinnings, and introduce a two-approximate polynomial time algorithm to minimize total distance travelled. Furthermore, we show that allowing transfers to take place at any location for the CDP-T results in at most a factor of two improvement. We demonstrate our approximation algorithms on large simulated problem instances. Finally, we deploy our algorithms on robots that transfer and deliver items autonomously in an office building.

    Quantifying the environmental benefits of collection/delivery points

    No full text
    Using a node-based routing and scheduling package, this paper estimates the environmental impacts of using a local railway station as a collection/delivery point (CDP) for small parcel transactions. This delivery option was compared with a typical existing situation where some customers who suffer a failed home delivery attempt decide to travel to the carrier's depot to collect their goods. The modelled results suggested that, at a 20 per cent take-up level, the CDP method would reduce the carbon monoxide emissions associated with the deliveries by around 20 per cent and other emissions (nitrogen oxide, particulate matter, carbon dioxide and hydrocarbons) by between 13 per cent and 15 per cent, with higher savings at higher take-up levels. The customer mileage attributable to the collection was modelled to reduce by up to 33 per cent. Modest travel savings were also found for the carrie

    A review on assembly sequence planning and assembly line balancing optimisation using soft computing approaches

    Get PDF
    Assembly optimisation activities occur across development and production stages of manufacturing goods. Assembly Sequence Planning (ASP) and Assembly Line Balancing (ALB) problems are among the assembly optimisation. Both of these activities are classified as NP-hard. Several soft computing approaches using different techniques have been developed to solve ASP and ALB. Although these approaches do not guarantee the optimum solution, they have been successfully applied in many ASP and ALB optimisation works. This paper reported the survey on research in ASP and ALB that use soft computing approaches for the past 10years. To be more specific, only Simple Assembly Line Balancing Problem (SALBP) is considered for ALB. The survey shows that three soft computing algorithms that frequently used to solve ASP and ALB are Genetic Algorithm, Ant Colony Optimisation and Particle Swarm Optimisation. Meanwhile, the research in ASP and ALB is also progressing to the next level by integration of assembly optimisation activities across product development stages
    corecore