An Improved Adaptive Large Neighborhood Search Algorithm for the Heterogeneous Customized Bus Service with Multiple Pickup and Delivery Candidate Locations
Bibliographic record
Abstract
In order to tackle the congestion and environmental issues, customized bus services are proposed and deployed in metropolitan areas. As emerging public transportation services, customized bus services bring passengers more convenience and accessibility. Besides, conventional customized bus services generally organize homogeneous fleet and single location selection to passengers. In this paper, to enhance the mobility and flexibility of customized buses and increase companies’ profit, we propose a new form of customized bus service with heterogeneous fleets and multiple candidate locations. First, a mixed-integer programming model (MIP) is developed to describe the customized bus problem. Compared with the conventional model, the proposed MIP is involved in the case of one passenger with multiple candidate pickup or delivery locations and can be solved by GUROBI on small scale, quickly and efficiently. Second, an improved adaptive large neighborhood search algorithm ( <a:math xmlns:a="http://www.w3.org/1998/Math/MathML" id="M1"> <a:msub> <a:mrow> <a:mtext>ALNS</a:mtext> </a:mrow> <a:mrow> <a:mi>i</a:mi> <a:mi>p</a:mi> </a:mrow> </a:msub> </a:math> ) is utilized to address the large-scale problem more efficiently. Time slack calculation method is then designed to optimize vehicle timetables, which provides stable and excellent performance for searching feasible solutions. In addition, we propose two inserting operators to deal with the problem with multiple candidate locations and analyse its influence on the results. Finally, we test the performance of the proposed model and algorithm on the numerical experiments. And they are verified the effectiveness and implication in a small-scale case on a simplified Sioux waterfall network and a large-scale problem in Beijing, China. The result shows that <c:math xmlns:c="http://www.w3.org/1998/Math/MathML" id="M2"> <c:msub> <c:mrow> <c:mtext>ALNS</c:mtext> </c:mrow> <c:mrow> <c:mi>i</c:mi> <c:mi>p</c:mi> </c:mrow> </c:msub> </c:math> outperforms other algorithms in searching for more satisfying solutions with higher efficiency. However, the GUROBI solver can obtain the solution to small-scale problems within a shorter time than <e:math xmlns:e="http://www.w3.org/1998/Math/MathML" id="M3"> <e:msub> <e:mrow> <e:mtext>ALNS</e:mtext> </e:mrow> <e:mrow> <e:mi>i</e:mi> <e:mi>p</e:mi> </e:mrow> </e:msub> </e:math> . Furthermore, it can be suggested that the heterogeneous fleets service with multiple candidate locations is helpful to facilitate collaboration among vehicles and optimize pickup and delivery routes in consequence.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".