In this paper we study a long-haul truck scheduling problem where path has to be determined for vehicle traveling from specified origin destination. We consider refueling decisions along the path, while accounting heterogeneous fuel prices in road network. Furthermore, comply with Hours of Service (HoS) regulations. Therefore, is defined by actual trajectory traveled vehicle, as well locations ...

In cities where the urban rail transit (URT) systems do not provide 24-h services, passengers may be able to reach their destinations if last train services have closed by time they arrive at transfer stations. This paper aims seek a well-coordinated timetable that can transport as many possible (referred reachable passengers) and also those who cannot unreachable stations close destinations. A...

This paper presents a new two-phase algorithm for the bi-objective minimum spanning tree (BMST) problem. In first phase, it computes extreme supported efficient solutions resorting to both mathematical programming and algorithmic approaches, while second phase is devoted obtaining remaining (non-extreme non-supported). latter based on recursive procedure capable of generating all trees connecte...