The Experts below are selected from a list of 312 Experts worldwide ranked by ideXlab platform
Sk Sharma - One of the best experts on this subject based on the ideXlab platform.
-
a gis based Transportation Model for solid waste disposal a case study on asansol municipality
Waste Management, 2006Co-Authors: Mk Ghose, A K Dikshit, Sk SharmaAbstract:Abstract Uncontrolled growth of the urban population in developing countries in recent years has made solid waste management an important issue. Very often, a substantial amount of total expenditures is spent on the collection of solid waste by city authorities. Optimization of the routing system for collection and transport of solid waste thus constitutes an important component of an effective solid waste management system. This paper describes an attempt to design and develop an appropriate storage, collection and disposal plan for the Asansol Municipality Corporation (AMC) of West Bengal State (India). A GIS optimal routing Model is proposed to determine the minimum cost/distance efficient collection paths for transporting the solid wastes to the landfill. The Model uses information on population density, waste generation capacity, road network and the types of road, storage bins and collection vehicles, etc. The proposed Model can be used as a decision support tool by municipal authorities for efficient management of the daily operations for transporting solid wastes, load balancing within vehicles, managing fuel consumption and generating work schedules for the workers and vehicles. The total cost of the proposed collection systems is estimated to be around 80 million rupees for the fixed cost of storage bins, collection vehicles and a sanitary landfill and around 8.4 million rupees for the annual operating cost of crews, vehicles and landfill maintenance. A substantial amount (25 million rupees/yr) is currently being spent by AMC on waste collection alone without any proper storage/collection system and sanitary landfill. Over a projected period of 15 yr, the overall savings is thus very significant.
Ruben Romero - One of the best experts on this subject based on the ideXlab platform.
-
analysis of heuristic algorithms for the Transportation Model in static and multistage planning in network expansion systems
IEE Proceedings - Generation Transmission and Distribution, 2003Co-Authors: Ruben Romero, C Rocha, M Mantovani, Jose Roberto Sanches MantovaniAbstract:The usefulness of the application of heuristic algorithms in the Transportation Model, first proposed by Garver, is analysed in relation to planning for the expansion of transmission systems. The formulation of the mathematical Model and the solution techniques proposed in the specialised literature are analysed in detail. Starting with the constructive heuristic algorithm proposed by Garver, an extension is made to the problem of multistage planning for transmission systems. The quality of the solutions found by heuristic algorithms for the Transportation Model is analysed, as are applications in problems of planning transmission systems.
-
branch and bound algorithm for transmission system expansion planning using a Transportation Model
IEE Proceedings - Generation Transmission and Distribution, 2000Co-Authors: Sergio Haffner, Jose Roberto Sanches Mantovani, A Monticelli, Ariovaldo V Garcia, Ruben RomeroAbstract:A method for optimal transmission network expansion planning is presented. The transmission network is Modelled as a Transportation network. The problem is solved using hierarchical Benders decomposition in which the problem is decomposed into master and slave subproblems. The master subproblem Models the investment decisions and is solved using a branch-and-bound algorithm. The slave subproblem Models the network operation and is solved using a specialised linear program. Several alternative implementations of the branch-and-bound algorithm have been tested. Special characteristics of the transmission expansion problem have been taken into consideration in these implementations. The methods have been tested on various test systems available in the literature.
-
a hierarchical decomposition approach for transmission network expansion planning
IEEE Transactions on Power Systems, 1994Co-Authors: Ruben Romero, A MonticelliAbstract:This paper presents a hierarchical decomposition approach for optimal transmission network expansion planning. A major difficulty in obtaining global optimal solutions for complex, real-life networks is due to the nonconvexity of the problem. Hierarchical decomposition has proved to be an efficient heuristic for coping with nonconvexity, as illustrated in the test results section of the paper. Significant reductions in investment costs have been obtained in some practical cases for which results are available in the literature. The current implementation of the hierarchical decomposition approach utilizes three different levels of network Modeling: Transportation Models, hybrid Models, and linearized power flow Models. An initial solution is obtained for the simplest Model (Transportation Model) and as one moves towards the final solution the algorithm successively switches to more accurate Models. >
Yu Liu - One of the best experts on this subject based on the ideXlab platform.
-
a regional economy land use and Transportation Model relu tran formulation algorithm design and testing
Journal of Regional Science, 2007Co-Authors: Alex Anas, Yu LiuAbstract:RELU is a dynamic general equilibrium Model of a metropolitan economy and its land use, derived by unifying in a theoretically valid way, Models developed by one of the authors [Anas (1982), Anas-Arnott (1991, 1997), Anas-Kim (1996), Anas-Xu (1999)]. RELU equilibrates floor space, land and labor markets, and the market for the products of industries, treating development (construction and demolition), spatial interindustry linkages, commuting, and discretionary travel. Mode choices and equilibrium congestion on the highway network are treated by unifying RELU with the TRAN algorithm of stochastic user equilibrium [Anas-Kim (1990)]. The RELU-TRAN algorithm's performance for a stationary state is demonstrated for a prototype consisting of 4-building, 4-industry, 4-labor-type, 15-land-use-zone, 68-link-highway-network version of the Chicago MSA. The algorithm solves 656 equations in a special block-recursive convergent procedure by iterations nested within loops and loops within cycles. Runs show excellent and smooth convergence from different starting points, so that the number of loops within successive cycles continually decreases. The tests also imply a numerically ascertained unique stationary equilibrium solution of the unified Model for the calibrated parameters. Copyright Blackwell Publishing, Inc. 2007
Iori Tani - One of the best experts on this subject based on the ideXlab platform.
-
an adaptive and robust biological network based on the vacant particle Transportation Model
Journal of Theoretical Biology, 2011Co-Authors: Yukiopegio Gunji, Tomohiro Shirakawa, Takayuki Niizato, Masaki Yamachiyo, Iori TaniAbstract:Abstract A living system reveals local computing by referring to a whole system beyond the exploration–exploitation dilemma. The slime mold, Physarum polycephalum, uses protoplasmic flow to change its own outer shape, which yields the boundary condition and forms an adaptive and robust network. This observation suggests that the whole Physarum can be represented as a local protoplasmic flow system. Here, we show that a system composed of particles, which move and are modified based upon the particle transformation that contains the relationship between the parts and the whole, can emulate the network formed by Physarum. This system balances the exploration–exploitation trade-off and shows a scale-free sub-domain. By decreasing the number of particles, our Model, VP-S, can emulate the Physarum adaptive network as it is attracted to a food stimulus. By increasing the number of particles, our Model, VP-D, can emulate the pattern of a growing Physarum. The patterns produced by our Model were compared with those of the Physarum pattern quantitatively, which showed that both patterns balance exploration with exploitation. This Model should have a wide applicability to study biological collective phenomena in general.
A Monticelli - One of the best experts on this subject based on the ideXlab platform.
-
branch and bound algorithm for transmission system expansion planning using a Transportation Model
IEE Proceedings - Generation Transmission and Distribution, 2000Co-Authors: Sergio Haffner, Jose Roberto Sanches Mantovani, A Monticelli, Ariovaldo V Garcia, Ruben RomeroAbstract:A method for optimal transmission network expansion planning is presented. The transmission network is Modelled as a Transportation network. The problem is solved using hierarchical Benders decomposition in which the problem is decomposed into master and slave subproblems. The master subproblem Models the investment decisions and is solved using a branch-and-bound algorithm. The slave subproblem Models the network operation and is solved using a specialised linear program. Several alternative implementations of the branch-and-bound algorithm have been tested. Special characteristics of the transmission expansion problem have been taken into consideration in these implementations. The methods have been tested on various test systems available in the literature.
-
a hierarchical decomposition approach for transmission network expansion planning
IEEE Transactions on Power Systems, 1994Co-Authors: Ruben Romero, A MonticelliAbstract:This paper presents a hierarchical decomposition approach for optimal transmission network expansion planning. A major difficulty in obtaining global optimal solutions for complex, real-life networks is due to the nonconvexity of the problem. Hierarchical decomposition has proved to be an efficient heuristic for coping with nonconvexity, as illustrated in the test results section of the paper. Significant reductions in investment costs have been obtained in some practical cases for which results are available in the literature. The current implementation of the hierarchical decomposition approach utilizes three different levels of network Modeling: Transportation Models, hybrid Models, and linearized power flow Models. An initial solution is obtained for the simplest Model (Transportation Model) and as one moves towards the final solution the algorithm successively switches to more accurate Models. >
