01031509

Component

https://doi.org/10.3141/1964-06

http://scholar.google.com...Chou&publication_year=2006

The reverse supply chain network design problem is formulated as a bilevel model. In the upper level, the total cost incurred in the reverse supply chain network is minimized subject to the budget constraint, among others, whereas in the lower level the corresponding flow pattern in the network is characterized by the variable demand equilibrium conditions; this is essentially a variation of the Wardrop second principle. A sensitivity analysis–based algorithm, with special treatment of the material conversion factor at each recycler processor agent, or both, is proposed for solutions. A numerical example is then provided for demonstration.

01037567

English

pp 42-49

2006

Transportation Research Record: Journal of the Transportation Research Board

0309099730

Print

Figures (3) ; References (24) ; Tables (3)

Algorithms; Costs; Demand; Design; Equilibrium (Systems); Mathematical models; Network analysis (Planning); Physical distribution; Sensitivity analysis; Supply chain management

Design; Finance; Freight Transportation; Highways; Planning and Forecasting; I72: Traffic and Transport Planning

TRIS, TRB, ATRI

Mar 3 2006 10:22AM

• Arriving-on-Time Problem: Discrete Algorithm That Ensures Convergence
• Cell-Based Network Optimization Model for Staged Evacuation Planning Under Emergencies
• Combined Model for Intermodal Networks with Variable Transit Frequencies
• Decomposition Scheme for Continuous Network Design Problem with Asymmetric User Equilibria
• Derivation of Origin–Destination Distributions from Traffic Counts: Implications for Freeway Simulation
• Difference Between Area-Based and Cordon-Based Congestion Pricing: Investigation by Trip-Chain-Based Network Equilibrium Model with Nonadditive Path Costs
• Doubly Uncertain Transport Network: Degradable Link Capacity and Perception Variations in Traffic Conditions
• Dynamic Continuous Network Design Problem: Linear Bilevel Programming and Metaheuristic Approaches
• Dynamic Origin-Destination Trip Demand Estimation for Subarea Analysis
• Heuristic Priority Ranking of Emergency Evacuation Staging to Reduce Clearance Time
• Interactive Heuristic for Practical Vehicle Routing Problem with Solution Shape Constraints
• Interactive Learning in Transportation Networks with Uncertainty, Bounded Rationality, and Strategic Choice Behavior: Quantal Response Model
• Modeling Impact of Technological Changes on Urban Commercial Trips by Commercial Activity Routing Type
• New Reserve Capacity Model of Signal-Controlled Road Network
• Noniterative Approach to Dynamic Traffic Origin-Destination Estimation with Parallel Evolutionary Algorithms
• Number and Location of Sensors for Real-Time Network Traffic Estimation and Prediction: Sensitivity Analysis
• Optimal Scheduling of Evacuation Operations
• Proposed Framework for Simultaneous Optimization of Evacuation Traffic Destination and Route Assignment
• Quantifying Opportunity Costs in Sequential Transportation Auctions for Truckload Acquisition
• Real-Time Mass Passenger Transport Network Optimization Problems
• Real-Time Traffic Volatility Forecasting in Urban Arterial Networks
• Reliable Network Design Problem: Case with Uncertain Demand and Total Travel Time Reliability
• Selectorecombinative Genetic Algorithm to Relax Computational Complexity of Discrete Network Design Problem
• Single-Point Approximations for Traffic Equilibrium Problem Under Uncertain Demand
• Stochastic Heuristic Dynamic Assignment Based on AIMSUN Microscopic Traffic Simulator
• Survival Analysis-Based Dynamic Travel Demand Models for Hurricane Evacuation
• Tabu-Based Heuristic Approach for Optimization of Network Evacuation Contraflow
• Variable Toll Pricing and Heterogeneous Users: Model and Solution Algorithm for Bicriterion Dynamic Traffic Assignment Problem