ORCID Profile
0000-0002-3805-4819
Current Organisations
RMIT University
,
Monash University
,
University of Queensland
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 1998
DOI: 10.1109/72.728380
Abstract: After more than a decade of research, there now exist several neural-network techniques for solving NP-hard combinatorial optimization problems. Hopfield networks and self-organizing maps are the two main categories into which most of the approaches can be ided. Criticism of these approaches includes the tendency of the Hopfield network to produce infeasible solutions, and the lack of generalizability of the self-organizing approaches (being only applicable to Euclidean problems). This paper proposes two new techniques which have overcome these pitfalls: a Hopfield network which enables feasibility of the solutions to be ensured and improved solution quality through escape from local minima, and a self-organizing neural network which generalizes to solve a broad class of combinatorial optimization problems. Two s le practical optimization problems from Australian industry are then used to test the performances of the neural techniques against more traditional heuristic solutions.
Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
Date: 05-2022
Abstract: When shipping ports are colocated with major population centers, the exclusive use of road transport for moving shipping containers across the metropolitan area is undesirable from both social and economic perspectives. Port shuttles, an integrated road and short-haul rail transport modality, are thereby gaining significant interest from governments and industry alike, especially in the Australian context. In “A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem,” Perrykkad, Ernst, and Krishnamoorthy explore the mathematics behind the optimal integration of road and port shuttle modalities for container transportation in metropolitan areas, including proofs of NP harness, a Benders decomposition, and an extensive computational study. Critically, to accelerate their Benders decomposition the authors develop the simultaneous Magnanti-Wong method: an extension of the classical Magnanti-Wong acceleration that preserves this problem's important network substructure. In addition to the problem at hand, this technique shows promise more generally for Benders decompositions with special subproblem structure.
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2014
Publisher: Elsevier BV
Date: 09-1996
Publisher: Cognizant, LLC
Date: 2003
Publisher: Elsevier BV
Date: 06-2004
Publisher: Springer US
Date: 1996
Publisher: IEEE
Date: 02-2013
Publisher: Springer US
Date: 2001
Publisher: Informa UK Limited
Date: 2004
Publisher: Elsevier BV
Date: 07-2009
Publisher: Elsevier BV
Date: 12-2009
Publisher: Springer International Publishing
Date: 28-07-2018
Publisher: Springer Science and Business Media LLC
Date: 2001
Publisher: Informa UK Limited
Date: 07-2010
DOI: 10.1057/JORS.2009.78
Publisher: Springer International Publishing
Date: 2017
Publisher: Elsevier BV
Date: 05-2003
Publisher: Elsevier BV
Date: 05-2012
Publisher: Elsevier BV
Date: 02-2004
Publisher: Springer Science and Business Media LLC
Date: 02-08-2017
Publisher: Elsevier BV
Date: 12-2017
Publisher: IEEE
Date: 10-2013
Publisher: Springer Science and Business Media LLC
Date: 04-04-2015
Publisher: Elsevier BV
Date: 02-2000
Publisher: IEEE
Date: 12-2016
Publisher: Informa UK Limited
Date: 16-10-2015
Publisher: IEEE
Date: 12-2016
Publisher: IEEE
Date: 24-09-2017
DOI: 10.15439/2017F237
Publisher: Elsevier BV
Date: 10-1996
Publisher: Elsevier BV
Date: 03-2018
Publisher: Springer Science and Business Media LLC
Date: 04-2004
Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
Date: 10-2005
Abstract: Hub networks play an important role in many transportation and telecommunications systems. This paper introduces a new model called the hub arc location model. Rather than locate discrete hub facilities, this model locates hub arcs, which have reduced unit flow costs. Four special cases of the general hub arc location model are examined in detail. We provide motivation for the new models, and present ex les and optimal solutions, using data for U.S. air passenger traffic. Results are used to compare optimal costs, hub locations, and hub arc locations with corresponding hub median optimal solutions. The results reveal interesting spatial patterns and help identify promising cities and regions for hubs. A companion paper (C bell et al. 2005) presents integer programming formulations and solution algorithms for the new hub arc problems. It also provides details and computation times for these solution algorithms.
Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
Date: 10-2005
Abstract: A companion paper (C bell et al. 2005) introduces new hub arc location models and analyzes optimal solutions, with special attention to spatial pattens and relationships. This paper provides integer programming formulations and optimal solution algorithms for these problems. We describe two optimal solution approaches in detail and compare their performance, using standard hub location data sets. We present implementation details and show how algorithms can be fine tuned based on characteristics of the data.
Publisher: Elsevier BV
Date: 10-1996
Publisher: Informa UK Limited
Date: 05-2013
Publisher: Elsevier BV
Date: 12-2014
Publisher: Elsevier BV
Date: 02-2019
Publisher: Elsevier BV
Date: 06-1996
Publisher: Wiley
Date: 10-1999
DOI: 10.1002/(SICI)1097-0037(199910)34:3<229::AID-NET8>3.0.CO;2-W
Publisher: Springer Berlin Heidelberg
Date: 2002
Publisher: National Library of Serbia
Date: 2017
Abstract: In this paper, a dynamic multi-objective linear integer programming model is proposed to optimally distribute a firm?s advertising budget among multiple products and media in a segmented market. To make the media plan responsive to the changes in the market, the distribution is carried out dynamically by iding the planning horizon into smaller periods. The model incorporates the effect of the previous period advertising reach on the current period (taken through retention factor), and it also considers cross-product effect of simultaneously advertising different products. An application of the model is presented for an insurance firm that markets five different products, using goal programming approach.
Publisher: Elsevier BV
Date: 09-2015
Publisher: Springer Berlin Heidelberg
Date: 2015
Publisher: Elsevier BV
Date: 08-2014
Publisher: Elsevier BV
Date: 10-2015
Publisher: Springer Science and Business Media LLC
Date: 03-2004
Publisher: Elsevier BV
Date: 12-2018
Publisher: Elsevier BV
Date: 10-2015
Publisher: Elsevier BV
Date: 07-2014
Publisher: Springer Science and Business Media LLC
Date: 24-02-2017
Publisher: Springer Science and Business Media LLC
Date: 2001
Publisher: Elsevier BV
Date: 1998
Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
Date: 08-2007
Abstract: Tourism Holdings Limited (THL), with 14 locations in Australia and New Zealand, operates a fleet of approximately 4,000 recreational rental vehicles of many types. It allocates vehicles to bookings centrally. If demand for a particular vehicle type at a location exceeds supply, THL may substitute vehicles of similar types or relocate vehicles from other locations to the location that needs the vehicles. The static problem that THL faces daily is to determine a vehicle schedule that minimizes the tangible and intangible costs of such substitutions and relocations. The dynamic problem is to determine—sometimes as the customer waits—whether a vehicle will be available to cover a potential booking and to incorporate that booking into the schedule. The Commonwealth Scientific and Industrial Research Organisation (CSIRO) has researched, developed, and supplied software, VASS and D-VASS, to solve the static and dynamic aspects of THL’s schedule creation and maintenance. This paper describes the THL problem, the systems that CSIRO implemented, and how THL embedded these systems into its operations.
Publisher: Elsevier BV
Date: 12-2015
Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
Date: 10-2006
Abstract: The task allocation problem (TAP) is one where a number of tasks or modules need to be assigned to a set of processors or machines at minimum overall cost. The overall cost includes the communication cost between tasks that are assigned to different processors and other costs such as the assignment cost and the fixed cost of using processors. Processors may have limited or unlimited capacities to perform tasks. Task allocation has been applied to the design of distributed computing systems and also in auto-manufacturing contexts. We present several integer programs and a column generation formulation for the uncapacitated and the capacitated TAP. Computational experiments are carried out to demonstrate computational capabilities of integer programming and the column generation formulations for the uncapacitated TAP (UTAP). Excellent results are obtained for the column generation formulation. We also report some computational experience for the capacitated TAP (CTAP).
Publisher: Wiley
Date: 29-02-2016
DOI: 10.1002/NET.21675
Publisher: Elsevier BV
Date: 04-2019
Location: United Kingdom of Great Britain and Northern Ireland
Location: United Kingdom of Great Britain and Northern Ireland
No related grants have been discovered for Mohan Krishnamoorthy.