FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W123613426> ?p ?o ?g. }

• W123613426 endingPage "75" @default.
• W123613426 startingPage "56" @default.
• W123613426 abstract "This research provides a new and efficient approach to solve the Transit Route Design (TRD ) problem. This is considered the most complex and cumbersome problem across network route allocation problems. The wide range of the TRD characteristics creates difficulties to formulize the problem uniquely. At the same time, the TRD complexity type creates combinatorial problems, and its formulation cannot be solved via known mathematical programming approaches and packages. The suggested model deals with both its complexity and its practical issues. This is the first time that three transit operational components are being considered simultaneously: route design; timetabling (frequencies); and vehicle scheduling. The approach used has an impact on three components involved: the operator, the user, and the considered authority. The objectives of these three components do not always coincide. From the operator viewpoint, the system should minimize its expenses while, from the user perspective, the system should maximize its level-of-service. This trade-off situation creates this work’s optimization framework. The formulation of this work contains two objective functions — each to be minimized. However, it is impossible to treat both functions simultaneously, and hence, multi-objective programming is being used. This multi-objective programming technique was not used, to our knowledge, for solving the TOD problem. In fact, due to the problem complexity, the ordinary mathematical programming methods cannot be used in this technique, and therefore, a new approach is provided. This new procedure is heuristic in nature and divided into two phases: (a) generation of finite sets of alternative efficient non-inferior solutions, and (b) evaluation and selection of the various solutions using multi-objective preference techniques for discrete variables (“compromise programming” procedure). This approach enables to solve the complex TRD problem. It combines mathematical programming with decision-making methods, using search and enumeration processes while performing the optimization. Thus, it is possible to encounter relatively large-scale problems (networks) with the possibility to interact with the solution method during intermediate steps." @default.
• W123613426 created "2016-06-24" @default.
• W123613426 creator A5032483455 @default.
• W123613426 creator A5079958900 @default.
• W123613426 date "1995-01-01" @default.
• W123613426 modified "2023-10-01" @default.
• W123613426 title "Transit Route Design Using Scheduling and Multiobjective Programming Techniques" @default.
• W123613426 cites W1604359064 @default.
• W123613426 cites W1976898311 @default.
• W123613426 cites W1978645998 @default.
• W123613426 cites W1982028039 @default.
• W123613426 cites W1985787409 @default.
• W123613426 cites W2008593696 @default.
• W123613426 cites W2024613980 @default.
• W123613426 cites W2043015715 @default.
• W123613426 cites W2043482243 @default.
• W123613426 cites W2049490216 @default.
• W123613426 cites W2060499510 @default.
• W123613426 cites W2063258564 @default.
• W123613426 cites W2080417473 @default.
• W123613426 cites W2099258657 @default.
• W123613426 cites W2165681141 @default.
• W123613426 cites W2169551611 @default.
• W123613426 cites W2171985270 @default.
• W123613426 cites W4233757421 @default.
• W123613426 doi "https://doi.org/10.1007/978-3-642-57762-8_5" @default.
• W123613426 hasPublicationYear "1995" @default.
• W123613426 type Work @default.
• W123613426 sameAs 123613426 @default.
• W123613426 citedByCount "33" @default.
• W123613426 countsByYear W1236134262012 @default.
• W123613426 countsByYear W1236134262013 @default.
• W123613426 countsByYear W1236134262014 @default.
• W123613426 countsByYear W1236134262015 @default.
• W123613426 countsByYear W1236134262016 @default.
• W123613426 countsByYear W1236134262017 @default.
• W123613426 countsByYear W1236134262018 @default.
• W123613426 countsByYear W1236134262019 @default.
• W123613426 countsByYear W1236134262020 @default.
• W123613426 countsByYear W1236134262023 @default.
• W123613426 crossrefType "book-chapter" @default.
• W123613426 hasAuthorship W123613426A5032483455 @default.
• W123613426 hasAuthorship W123613426A5079958900 @default.
• W123613426 hasConcept C104317684 @default.
• W123613426 hasConcept C126255220 @default.
• W123613426 hasConcept C158448853 @default.
• W123613426 hasConcept C17020691 @default.
• W123613426 hasConcept C185592680 @default.
• W123613426 hasConcept C206729178 @default.
• W123613426 hasConcept C33923547 @default.
• W123613426 hasConcept C41008148 @default.
• W123613426 hasConcept C55493867 @default.
• W123613426 hasConcept C61157135 @default.
• W123613426 hasConcept C86339819 @default.
• W123613426 hasConceptScore W123613426C104317684 @default.
• W123613426 hasConceptScore W123613426C126255220 @default.
• W123613426 hasConceptScore W123613426C158448853 @default.
• W123613426 hasConceptScore W123613426C17020691 @default.
• W123613426 hasConceptScore W123613426C185592680 @default.
• W123613426 hasConceptScore W123613426C206729178 @default.
• W123613426 hasConceptScore W123613426C33923547 @default.
• W123613426 hasConceptScore W123613426C41008148 @default.
• W123613426 hasConceptScore W123613426C55493867 @default.
• W123613426 hasConceptScore W123613426C61157135 @default.
• W123613426 hasConceptScore W123613426C86339819 @default.
• W123613426 hasLocation W1236134261 @default.
• W123613426 hasOpenAccess W123613426 @default.
• W123613426 hasPrimaryLocation W1236134261 @default.
• W123613426 hasRelatedWork W1507894569 @default.
• W123613426 hasRelatedWork W1543299114 @default.
• W123613426 hasRelatedWork W1882733036 @default.
• W123613426 hasRelatedWork W1969740176 @default.
• W123613426 hasRelatedWork W1992741870 @default.
• W123613426 hasRelatedWork W1993538932 @default.
• W123613426 hasRelatedWork W2160425906 @default.
• W123613426 hasRelatedWork W2546696010 @default.
• W123613426 hasRelatedWork W2997221951 @default.
• W123613426 hasRelatedWork W3174582865 @default.
• W123613426 isParatext "false" @default.
• W123613426 isRetracted "false" @default.
• W123613426 magId "123613426" @default.
• W123613426 workType "book-chapter" @default.