Maximum Entropy and Utility in a Transportation System
Modal Split Modelling Using Multicriteria Analysis and Discrete Fuzzy Sets
Models combination in (max,+) algebra for the implementation of a simulation and analysis software
This paper presents a modeling methodology in (max,+) algebra which has been developed in order to implement a modulary software for the simulation and the analysis of electronic cards production lines. More generally, this approach may be applied to hybrid flowshop type manufacturing systems.
Multiperiod supply chain network equilibrium model with electronic commerce and multicriteria decision-making
In this paper, we develop a supply chain network equilibrium model in which electronic commerce in the presence of both B2B (business-to-business) and B2C (business-to-consumer) transactions, multiperiod decision-making and multicriteria decision-making are integrated. The model consists of three tiers of decision-makers (manufacturers, retailers and consumers at demand markets) who compete within a tier but may cooperate between tiers. Both manufacturers and retailers are concerned with maximization...
Multiperiod supply chain network equilibrium model with electronic commerce and multicriteria decision-making∗∗∗
In this paper, we develop a supply chain network equilibrium model in which electronic commerce in the presence of both B2B (business-to-business) and B2C (business-to-consumer) transactions, multiperiod decision-making and multicriteria decision-making are integrated. The model consists of three tiers of decision-makers (manufacturers, retailers and consumers at demand markets) who compete within a tier but may cooperate between tiers. Both manufacturers and retailers are concerned with maximization...
Multiple routing strategies in a labelled network
We present here models and algorithms for the construction of efficient path systems, robust to possible variations of the characteristics of the network. We propose some interpretations of these models and proceed to numerical experimentations of the related algorithms. We conclude with a discussion of the way those concepts may be applied to the design of a Public Transportation System.
Multiple Routing Strategies in a Labelled Network
We present here models and algorithms for the construction of efficient path systems, robust to possible variations of the characteristics of the network. We propose some interpretations of these models and proceed to numerical experimentations of the related algorithms. We conclude with a discussion of the way those concepts may be applied to the design of a Public Transportation System.
Numerical solutions of the mass transfer problem
Let μ and ν be two probability measures on the real line and let c be a lower semicontinuous function on the plane. The mass transfer problem consists in determining a measure ξ whose marginals coincide with μ and ν, and whose total cost ∫∫ c(x,y)dξ(x,y) is minimum. In this paper we present three algorithms to solve numerically this Monge-Kantorovitch problem when the commodity being shipped is one-dimensional and not necessarily confined to a bounded interval. We illustrate these numerical...
On cycling in the simplex method of the transportation problem
This paper shows that cycling of the simplex method for the m × n transportation problem where k-1 zero basic variables are leaving and reentering the basis does not occur once it does not occur in the k × k assignment problem. A method to disprove cycling for a particular k is applied for k=2,3,4,5 and 6.
On designing connected rapid transit networks reducing the number of transfers
In this paper we introduce some improvements on an approach that we described elsewhere for solving a modification of the well-known extended rapid transit network design problem. Firstly, we propose an integer programming model for selecting the stations to be constructed and the links between them, in such a way that a connected rapid transit network is obtained. Secondly, we consider a linear 0-1 programming model for determining a route of minimum length in the rapid transit network between...
On designing connected rapid transit networks reducing the number of transfers
In this paper we introduce some improvements on an approach that we described elsewhere for solving a modification of the well-known extended rapid transit network design problem. Firstly, we propose an integer programming model for selecting the stations to be constructed and the links between them, in such a way that a connected rapid transit network is obtained. Secondly, we consider a linear 0-1 programming model for determining a route of minimum...
Optimal control of production and remanufacturing in a reverse logistics model with backlogging.
Optimal Distribution Centers Involving Supply Capacity, Demands and Budget Restriction
Optimal transfer-ordering strategy for a deteriorating inventory in declining market.
Optimization of Investments in Rail-Highway Crossings
Organizing Transportation on a Double-Track Line Under Conditions of Major Overhaul on One Track
Paradox in a Non-Linear Capacitated Transportation Problem
Pickup and delivery problem with split demand and transfers
We deal with a logistic problem motivated by a case study from a company dealing with inland transportation of piece goods in regular cycles. The problem consists in transportation of goods among regional centres – hubs of a network. Demands on transportation are contained in a matrix of flows of goods between pairs of hubs. The transport is performed by vehicles covering the shipping demands and the task is to design a cyclical route and to place a depot for each vehicle. The route depot can be...
Piece-wise optimal control in transport allocation problem
Plus court chemin avec dépendance horaire : résolution et application aux problèmes de tournées