Mathematical programming models for road repair scheduling—On aging bridges in Japan—
This paper proposes two mathematical programming models to deal with a scheduling problem on the renovation of several roads that need to be repaired by a certain date. A typical example of the scheduling problem is the one for aging and deteriorating bridges in Japan. Our idea behind the formulatio...
Main Author: | Shungo KOICHI |
---|---|
Format: | Article |
Language: | English |
Published: |
The Japan Society of Mechanical Engineers
2016-07-01
|
Series: | Journal of Advanced Mechanical Design, Systems, and Manufacturing |
Subjects: | |
Online Access: | https://www.jstage.jst.go.jp/article/jamdsm/10/3/10_2016jamdsm0046/_pdf/-char/en |
Similar Items
-
An SDP Dual Relaxation for the Robust Shortest-Path Problem with Ellipsoidal Uncertainty: Pierra’s Decomposition Method and a New Primal Frank–Wolfe-Type Heuristics for Duality Gap Evaluation
by: Chifaa Al Dahik, et al.
Published: (2022-10-01) -
Effective indexing for approximate constrained shortest path queries on large road networks
by: Wang, Sibo, et al.
Published: (2017) -
Low Cost Simple Look-Up Table-Based PMSM Drive Considering DC-Link Voltage Variation
by: Do-Yun Kim, et al.
Published: (2020-07-01) -
Emergency Repair Scheduling Model for Road Network Integrating Rescheduling Feature
by: Shu-Shun Liu, et al.
Published: (2021-02-01) -
Evaluation of Shortest Paths in Road Network
by: Farrukh Shehzad, et al.
Published: (2009-06-01)