Approaching the Pareto Front in a Biobjective Bus Route Design Problem Dealing with Routing Cost and Individuals’ Walking Distance by Using a Novel Evolutionary Algorithm
This paper addresses a biobjective bus routing problem that pays attention to both the routing cost and the total distance walked by the individuals to reach their assigned pickup point. These two objectives are conflicting. Generally, the less the individuals walk, the more the number of visited pi...
Main Authors: | Herminia I. Calvete, Carmen Galé, José A. Iranzo |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-04-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/10/9/1390 |
Similar Items
-
A Partial Allocation Local Search Matheuristic for Solving the School Bus Routing Problem with Bus Stop Selection
by: Herminia I. Calvete, et al.
Published: (2020-07-01) -
A Bilevel Approach to the Facility Location Problem with Customer Preferences Under a Mill Pricing Policy
by: Herminia I. Calvete, et al.
Published: (2024-11-01) -
Crop Planning in Synchronized Crop-Demand Scenarios: A Biobjective Optimization Formulation
by: Belarmino Adenso-Díaz, et al.
Published: (2021-09-01) -
Research on Site Selection of Ship Tank Washing Stations Based on a Biobjective Optimization Model
by: Yong Xu, et al.
Published: (2024-01-01) -
Solving biobjective network flow problem associated with minimum cost-time loading
by: O. Baghani, et al.
Published: (2020-09-01)