A column-generation matheuristic approach for optimizing first-mile ridesharing services with publicly- and privately-owned autonomous vehicles

The burden of first-mile connection to public transit stations is a key barrier that discourages riders from taking public transportation. Public transit agencies typically operate a modest fleet of vehicles to provide first-mile services due to the high operating costs, thus failing to adequately meet the first-mile travel demands,...

Dynamic anti-collision A-star algorithm for multi-ship encounter situations

For the complex multi-ship encounter scenarios, this article proposes a dynamic collision avoidance path planning algorithm based on the A-star algorithm and ship navigation rules, namely Dynamic Anti-collision A-star (DAA-star) algorithm. A dynamic search mechanism of the DAA-star algorithm considering time factors is designed to enable the...

Molecular Dynamics Simulation of Sintering Densification of Multi-Scale Silver Layer

Based on molecular dynamics (MD), in this study, a model was established to simulate the initial coating morphology of silver paste by using a random algorithm, and the effects of different sizes of particles on sintering porosity were also analyzed. The MD result reveals that compared with the sintering process using large-scale silver...

Time/Sequence-Dependent Scheduling: The design and evaluation of a general purpose tabu-based adaptive large neighbourhood search algorithm

In intelligent manufacturing, it is important to schedule orders from customers efficiently. Make-to-order companies may have to reject or postpone orders when the production capacity does not meet the demand. Many such real-world scheduling problems are characterised by processing times being dependent on the start time (time dependency) or...

Order Acceptance and Scheduling with Sequence-Dependent Setup Times: A New Memetic Algorithm and Benchmark of the State of the Art

The Order Acceptance and Scheduling (OAS) problem describes a class of real-world problems such as in smart manufacturing and satellite scheduling. This problem consists of simultaneously selecting a subset of orders to be processed as well as determining the associated schedule. A common generalization includes sequence-dependent setup times...