SCDA: School Compatibility Decomposition Algorithm for Solving the Multi-School Bus Routing and Scheduling Problem

2017-11-01 · Zhongxiang Wang, Ali Shafahi, Ali Haghani

Safely serving the school transportation demand with the minimum number of buses is one of the highest financial goals of school transportation directors. To achieve that objective, a good and efficient way to solve the routing and scheduling problem is required. Due to the growth of the computing power, the spotlight has been shed on solving the combined problem of the school bus routing and scheduling problem. We show that an integrated multi-school bus routing and scheduling can be formulated with the help of trip compatibility. A novel decomposition algorithm is proposed to solve the integrated model. The merit of this integrated model and the decomposition method is that with the consideration of the trip compatibility, the interrelationship between the routing and scheduling sub-problems will not be lost in the process of decomposition. Results show the proposed decomposed problem could provide the solutions using the same number of buses as the integrated model in much shorter time (as little as 0.6%) and that the proposed method can save up to 26% number of buses from existing research.

📄 PDF Abstract BibTeX arXiv:1711.00532

Code (0)

등록된 구현이 없습니다.

Tasks

Scheduling

School bus routing by maximizing trip compatibility

2017-11-01 · Ali Shafahi, Zhongxiang Wang, Ali Haghani

School bus planning is usually divided into routing and scheduling due to the complexity of solving them concurrently. However, the separation between these two steps may lead to worse solutions with higher overall costs…

Blocking Scheduling

Weight-based Fish School Search algorithm for Many-Objective Optimization

2017-08-16 · F. B. Lima Neto, I. M. C. Albuquerque, J. B. Monteiro Filho

Optimization problems with more than one objective consist in a very attractive topic for researchers due to its applicability in real-world situations. Over the years, the research effort in the Computational Intelligen…

Clustering

Selective Convolutional Descriptor Aggregation for Fine-Grained Image Retrieval

2016-04-18 · Xiu-Shen Wei, Jian-Hao Luo, Jianxin Wu, Zhi-Hua Zhou

Deep convolutional neural network models pre-trained for the ImageNet classification task have been successfully adopted to tasks in other domains, such as texture description and object proposal generation, but these ta…

Image Retrieval Object Proposal Generation Retrieval

MSCDA: Multi-level Semantic-guided Contrast Improves Unsupervised Domain Adaptation for Breast MRI Segmentation in Small Datasets

2023-01-04 · Sheng Kuang, Henry C. Woodruff, Renee Granzier, Thiemo J. A. van Nijnatten 외

Deep learning (DL) applied to breast tissue segmentation in magnetic resonance imaging (MRI) has received increased attention in the last decade, however, the domain shift which arises from different vendors, acquisition…

Contrastive Learning Domain Adaptation MRI segmentation Unsupervised Domain Adaptation

Open Set Domain Adaptation By Novel Class Discovery

2022-03-07 · Jingyu Zhuang, Ziliang Chen, Pengxu Wei, Guanbin Li 외

In Open Set Domain Adaptation (OSDA), large amounts of target samples are drawn from the implicit categories that never appear in the source domain. Due to the lack of their specific belonging, existing methods indiscrim…

Domain Adaptation Novel Class Discovery